작심삼일

문제 링크: 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

문제 링크: https://leetcode.com/problems/divide-two-integers/ 문제 Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. The integer division should truncate toward zero, which means losing its fractional part. For example, 8.345 would be truncated to 8, and -2.7335 would be truncated to -2. Return the quotient after dividing dividend by..

문제 링크: https://leetcode.com/problems/number-of-1-bits/ 문제 Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's interna..

문제 링크: https://leetcode.com/problems/russian-doll-envelopes/ Russian Doll Envelopes - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문제 You are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope. One envelope can..

문제 링크: https://leetcode.com/problems/ones-and-zeroes/ 문제 You are given an array of binary strings strs and two integers m and n. Return the size of the largest subset of strs such that there are at most m 0's and n 1's in the subset. A set x is a subset of a set y if all elements of x are also elements of y. 조건 1