넘치게 채우기

https://leetcode.com/problems/set-intersection-size-at-least-two/description/?envType=daily-question&envId=2025-11-20LeetCode - Set Intersection Size At Least Two문제 유형: 그리디, 투 포인터문제 난이도: Hard 문제You are given a 2D integer array intervals where intervals[i] = [starti, endi] represents all the integers from starti to endi inclusively.A containing set is an array nums where each interval from interv..

https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/description/?envType=daily-question&envId=2025-11-10LeetCode - Minimum Operations to Convert All Elements to Zero문제 유형: 모노토닉 스택(단조 증가 스택)문제 난이도: Medium 문제You are given an array nums of size n, consisting of non-negative integers. Your task is to apply some (possibly zero) operations on the array so that all elements..

https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/description/?envType=daily-question&envId=2025-11-08LeetCode - Minimum One Bit Operations to Make Integers Zero문제 유형: 그레이 코드, 비트 조작문제 난이도: Hard 문제Given an integer n, you must transform it into 0 using the following operations any number of times:Change the rightmost (0th) bit in the binary representation of n.Change t..

https://leetcode.com/problems/maximize-the-minimum-powered-city/description/?envType=daily-question&envId=2025-11-07Leetcode - Maximize the Minimum Powered City문제 유형: 슬라이딩 윈도우, 누적 합, 이진 탐색문제 난이도: Hard 문제You are given a 0-indexed integer array stations of length n, where stations[i] represents the number of power stations in the ith city.Each power station can provide power to every city in a fix..

https://leetcode.com/problems/find-x-sum-of-all-k-long-subarrays-ii/description/?envType=daily-question&envId=2025-11-05Leetcode - Find X-Sum of All K-Long Subarrays II문제 유형: 슬라이딩 윈도우, 집합, 해시맵문제 난이도: Hard 문제You are given an array nums of n integers and two integers k and x.The x-sum of an array is calculated by the following procedure:Count the occurrences of all elements in the array.Keep only ..