작심삼일

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

문제 링크: https://leetcode.com/problems/longest-increasing-path-in-a-matrix/ 문제 Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary (i.e., wrap-around is not allowed). 조건 m == matrix.length n == matrix[i].length 1

문제 링크: https://leetcode.com/problems/critical-connections-in-a-network/ 문제 There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [$a_i, b_i$] represents a connection between servers $a_i$ and $b_i$. Any server can reach other servers directly or indirectly through the network. A critical connection is a connecti..

문제 링크: https://leetcode.com/problems/shortest-path-in-binary-matrix/ 문제 Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that: All the visited cells of the path are 0. All the adjac..

문제 링크: https://leetcode.com/problems/permutations-ii/ 문제 Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. 조건 1

문제 링크: https://leetcode.com/problems/count-sorted-vowel-strings/ 문제 Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted. A string s is lexicographically sorted if for all valid i, s[i] is the same as or comes before s[i+1] in the alphabet. 조건 1

문제 링크: https://leetcode.com/problems/combination-sum-iii/ 문제 Find all valid combinations of k numbers that sum up to n such that the following conditions are true: Only numbers 1 through 9 are used. Each number is used at most once. Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order. 조건 2