넘치게 채우기

https://leetcode.com/problems/separate-squares-ii/description/?envType=daily-question&envId=2026-01-14LeetCode - Separate Squares II문제 유형: 이진 탐색, 세그먼트 트리, 라인 스위핑문제 난이도: Hard 문제You are given a 2D integer array squares. Each squares[i] = [xi, yi, li] represents the coordinates of the bottom-left point and the side length of a square parallel to the x-axis.Find the minimum y-coordinate value of a h..

https://leetcode.com/problems/number-of-ways-to-paint-n-3-grid/description/LeetCode - Number of Ways to Paint N x 3 Grid문제 유형: 다이나믹 프로그래밍문제 난이도: Hard 문제You have a grid of size n x 3 and you want to paint each cell of the grid with exactly one of the three colors: Red, Yellow, or Green while making sure that no two adjacent cells have the same color (i.e., no two cells that share vertical or hori..

https://leetcode.com/problems/last-day-where-you-can-still-cross/description/?envType=daily-question&envId=2025-12-31LeetCode - Last Day Where You Can Still Cross문제 유형: 유니온-파인드문제 난이도: Hard 문제There is a 1-based binary matrix where 0 represents land and 1 represents water. You are given integers row and col representing the number of rows and columns in the matrix, respectively.Initially on day 0,..

https://leetcode.com/problems/pyramid-transition-matrix/?envType=daily-question&envId=2025-12-29LeetCode - Pyramid Transition Matrix문제 유형: 구현, 백트래킹, 비트마스킹, dfs문제 난이도: Medium 문제You are stacking blocks to form a pyramid. Each block has a color, which is represented by a single letter. Each row of blocks contains one less block than the row beneath it and is centered on top.To make the pyramid aest..

https://leetcode.com/problems/delete-columns-to-make-sorted-iii/description/?envType=daily-question&envId=2025-12-22LeetCode - Delete Columns to Make Sorted III문제 유형: 다이나믹 프로그래밍, 문자열 처리문제 난이도: Hard 문제You are given an array of n strings strs, all of the same length.We may choose any deletion indices, and we delete all the characters in those indices for each string.For example, if we have strs = ..

https://leetcode.com/problems/find-all-people-with-secret/description/?envType=daily-question&envId=2025-12-19LeetCode - 2092. Find All People With Secret문제 유형: 유니온-파인드문제 난이도: Hard 문제You are given an integer n indicating there are n people numbered from 0 to n - 1. You are also given a 0-indexed 2D integer array meetings where meetings[i] = [xi, yi, timei] indicates that person xi and person yi ..

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-using-strategy/?envType=daily-question&envId=2025-12-18LeetCode - Best Time to Buy and Sell Stock using Strategy문제 유형: 구간 합, 슬라이딩 윈도우문제 난이도: Medium 문제You are given two integer arrays prices and strategy, where:prices[i] is the price of a given stock on the ith day.strategy[i] represents a trading action on the ith day, where:-1 indica..

https://leetcode.com/problems/maximum-profit-from-trading-stocks-with-discounts/description/?envType=daily-question&envId=2025-12-16LeetCode - Maximum Profit from Trading Stocks with Discounts문제 유형: 다이나믹 프로그래밍, 트리, 그래프문제 난이도: Hard 문제You are given an integer n, representing the number of employees in a company. Each employee is assigned a unique ID from 1 to n, and employee 1 is the CEO. You are ..

https://leetcode.com/problems/count-the-number-of-computer-unlocking-permutations/description/?envType=daily-questionLeetCode - Count the Number of Computer Unlocking Permutations문제 유형: 수학, 조합론, 애드 혹문제 난이도: Medium 문제You are given an array complexity of length n.There are n locked computers in a room with labels from 0 to n - 1, each with its own unique password. The password of the computer i ha..

https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/description/?envType=daily-question&envId=2025-12-06LeetCode - Count Partitions With Max-Min Difference at Most K문제 유형: 모노토닉 큐, 다이나믹 프로그래밍, 슬라이딩 윈도우문제 난이도: Medium 문제You are given an integer array nums and an integer k. Your task is to partition nums into one or more non-empty contiguous segments such that in each se..