작심삼일

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

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