작심삼일

문제 링크: https://leetcode.com/problems/continuous-subarray-sum/ 문제 Given an integer array nums and an integer k, return true if nums has a continuous subarray of size at least two whose elements sum up to a multiple of k, or false otherwise. An integer x is a multiple of k if there exists an integer n such that x = n * k. 0 is always a multiple of k. 조건 1

문제 링크: https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/ 문제 Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise. A string is represented by an array if the array elements concatenated in order forms the string. 조건 1

문제 링크: https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters/ 문제 You are given an array of strings arr. A string s is formed by the concatenation of a subsequence of arr that has unique characters. Return the maximum possible length of s. A subsequence is an array that can be derived from another array by deleting some or no elements without changing the or..

문제 링크: https://leetcode.com/problems/contains-duplicate-ii/ 문제 Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j)

문제 링크: https://leetcode.com/problems/integer-to-roman/ 문제 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II. Roman numerals are usua..

문제 링크: https://leetcode.com/problems/top-k-frequent-words/ 문제 Given an array of strings words and an integer k, return the k most frequent strings. Return the answer sorted by the frequency from highest to lowest. Sort the words with the same frequency by their lexicographical order. 조건 1

문제 링크: https://leetcode.com/problems/count-and-say/ 문제 The count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = "1" countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different digit string. To determine how you "say" a digit string, split it into the minimal number of substrings suc..

문제 링크: https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/ 문제 You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using 0-based indexing, where ⌊x⌋ denotes the largest integer less than or equal to x. For n = 1, 2, 3, 4, and 5, the middl..