작심삼일

문제 링크: https://leetcode.com/problems/kth-largest-element-in-an-array/ 문제 Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. 조건 1

문제 링크: https://leetcode.com/problems/short-encoding-of-words/ 문제 A valid encoding of an array of words is any reference string s and array of indices indices such that: words.length == indices.length The reference string s ends with the '#' character. For each index indices[i], the substring of s starting from indices[i] and up to (but not including) the next '#' character is equal to words[i]. ..

문제 링크: https://leetcode.com/problems/longest-palindromic-substring/ 문제 Given a string s, return the longest palindromic substring in s. 조건 1

문제 링크: https://leetcode.com/problems/longest-string-chain/ 문제 You are given an array of words where each word consists of lowercase English letters. wordA is a predecessor of wordB if and only if we can insert exactly one letter anywhere in wordA without changing the order of the other characters to make it equal to word_B. For example, "abc" is a predecessor of "abac", while "cba" is not a pred..

문제 링크: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ 문제 Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers$[index_1]$ and numbers$[index_2]$ where 1

문제 링크: https://leetcode.com/problems/remove-palindromic-subsequences/ 문제 You are given a string s consisting only of letters 'a' and 'b'. In a single step you can remove one palindromic subsequence from s. Return the minimum number of steps to make the given string empty. A string is a subsequence of a given string if it is generated by deleting some characters of a given string without changing..

문제 링크: https://leetcode.com/problems/merge-sorted-array/ 문제 You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored in..

문제 링크: https://leetcode.com/problems/transpose-matrix/ 문제 Given a 2D integer array matrix, return the transpose of matrix. The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices. 조건 m == matrix.length n == matrix[i].length 1