넘치게 채우기

https://leetcode.com/problems/minimum-xor-path-in-a-grid/description/?envType=daily-question&envId=2026-10-28 Minimum XOR Path in a Grid - LeetCodeCan you solve this real interview question? Minimum XOR Path in a Grid - You are given a 2D integer array grid of size m * n. You start at the top-left cell (0, 0) and want to reach the bottom-right cell (m - 1, n - 1). At each step, you may move eith..

https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/description/?envType=daily-question&envId=2026-03-02LeetCode - Minimum Swaps to Arrange a Binary Grid문제 유형: 정렬, 그리디문제 난이도: Medium 문제Given an n x n binary grid, in one step you can choose two adjacent rows of the grid and swap them.A grid is said to be valid if all the cells above the main diagonal are zeros.Return the minimum n..

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 ..