넘치게 채우기

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

https://leetcode.com/problems/count-number-of-trapezoids-ii/editorial/?envType=daily-question&envId=2025-12-03LeetCode - Count Number of Trapezoids II문제 유형: 기하학, 해시문제 난이도: Hard 문제You are given a 2D integer array points where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.Return the number of unique trapezoids that can be formed by choosing any four distin..

https://leetcode.com/problems/count-number-of-trapezoids-i/description/?envType=daily-question&envId=2025-12-02LeetCode - Count Number of Trapezoids I문제 유형: 기하학문제 난이도: Medium 문제You are given a 2D integer array points, where points[i] = [xi, yi] represents the coordinates of the ith point on the Cartesian plane.A horizontal trapezoid is a convex quadrilateral with at least one pair of horizontal ..

https://leetcode.com/problems/maximum-running-time-of-n-computers/description/?envType=daily-question&envId=2025-12-01Leetcode - Maximum Runnging Time of N Computers문제 유형: 이진탐색, 매개 변수 탐색, 그리디문제 난이도: Hard 문제You have n computers. You are given the integer n and a 0-indexed integer array batteries where the ith battery can run a computer for batteries[i] minutes. You are interested in running all n..