목록슬라이딩윈도우 (15)
넘치게 채우기
https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/description/leetcode - Minimum Number of K Consecutive Bit Flips문제 유형 : 그리디 / 비트마스킹 / 슬라이딩 윈도우문제 난이도 : Hard 문제You are given a binary array nums and an integer k.A k-bit flip is choosing a subarray of length k from nums and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.Return the minim..
https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/description/leetcode - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit문제 유형 : 슬라이딩 윈도우, 투 포인터, 데크(deque)문제 난이도 : Medium 문제Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference betwee..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/zWUn6/btsH8Gyr0Ma/FvbZyn48VOMzriI3yQCBV0/img.png)
https://leetcode.com/problems/count-number-of-nice-subarrays/description/leetcode - Count Number of Nice Subarrays문제 유형 : 슬라이딩 윈도우, 투포인터문제 난이도 : Medium 문제Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it.Return the number of nice sub-arrays. 정수배열 nums와 정수 k가 주어집니다. 연속적인 부분배열의 요소에 홀수의 요소가 정확히 k개 있으면, nice한 subarray입니다.nice한 sub..
https://leetcode.com/problems/grumpy-bookstore-owner/description/leetcode - Grumpy Bookstore Owner문제 유형 : 슬라이딩 윈도우문제 난이도 : Medium 문제There is a bookstore owner that has a store open for n minutes. Every minute, some number of customers enter the store. You are given an integer array customers of length n where customers[i] is the number of the customer that enters the store at the start of the it..
https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/description/leetcode - Minimum Number of Days to Make m Bouquets문제 유형 : 이진탐색, 그리디, 슬라이딩 윈도우, 구현문제 난이도 : Medium 문제You are given an integer array bloomDay, an integer m and an integer k.You want to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the garden.The garden consists of n flowers, the ith f..
https://leetcode.com/problems/get-equal-substrings-within-budget/description/leetcode - Get Equal Substrings Within Budget문제 유형 : 문자열 처리, 슬라이딩 윈도우문제 난이도 : Medium 문제You are given two strings s and t of the same length and an integer maxCost.You want to change s to t. Changing the ith character of s to ith character of t costs |s[i] - t[i]| (i.e., the absolute difference between the ASCII values o..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bVhmFd/btsGdSuDBab/6jZwn2HRRzNaFcwKOqucr0/img.png)
https://leetcode.com/problems/count-subarrays-with-fixed-bounds/description/ LeetCode - Count Subarrays With Fixed Bounds 문제 유형 : 슬라이딩 윈도우 문제 난이도 : Hard 문제 You are given an integer array nums and two integers minK and maxK. A fixed-bound subarray of nums is a subarray that satisfies the following conditions: The minimum value in the subarray is equal to minK. The maximum value in the subarray is..
https://leetcode.com/problems/subarrays-with-k-different-integers/ Leetcode - Subarrays with K Different Integers 문제 유형 : 슬라이딩 윈도우 / 해시 문제 난이도 : Hard 문제 Given an integer array nums and an integer k, return the number of good subarrays of nums. A good array is an array where the number of different integers in that array is exactly k. For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3..
https://leetcode.com/problems/length-of-longest-subarray-with-at-most-k-frequency/description/ Leetcode - Length of Longest Subarray With at Most K Frequency 문제 유형 : 슬라이딩 윈도우, 해시 문제 난이도 : Medium 문제 You are given an integer array nums and an integer k. The frequency of an element x is the number of times it occurs in an array. An array is called good if the frequency of each element in this array..
https://leetcode.com/problems/minimum-window-substring/description/?envType=daily-question&envId=2024-02-04 LeetCode - The World's Leading Online Programming Learning Platform 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 Leetcode - Minimum Window Substring 문제 유형 : 투 포인터, 슬라이딩 윈도우 문제 난이도 ..