Sliding Window
FundamentalsDynamic and fixed-size windows over contiguous subarrays or substrings
142 problems·17 Easy·88 Medium·37 Hard
Pattern Study Guide & Cheat Sheet▼
Track a contiguous subsegment of an array or string by expanding a right boundary and lazily contracting a left boundary whenever a constraint is broken.
Core Invariant: Monotonicity invariant: As `right` expands, window validity only degrades; advancing `left` only restores validity. Left pointer never moves backward, guaranteeing O(N) total pointer steps.
Recognize it (Keywords & Signals)
- Contiguous subarray or substring
- Longest / shortest substring meeting constraint K (e.g., at most K distinct chars)
- Find minimum size subarray with sum >= S (non-negative numbers)
- Fixed window of size K (e.g., maximum average of any subarray of size K)
When NOT to use
Array contains negative numbers and constraint is on sum (monotonicity is broken; must use Prefix Sum + Hash Map).
How to solve (Step-by-step)
- 1.Initialize `left = 0`, state tracking (e.g., frequency map or running sum), and `ans`.
- 2.Iterate `right` from 0 to len(arr) - 1, incorporating `arr[right]` into window state.
- 3.While the window constraint is broken: remove `arr[left]` from state and increment `left += 1`.
- 4.For longest valid window: update `ans = max(ans, right - left + 1)` after the shrink loop.
- 5.For shortest valid window: update `ans = min(ans, right - left + 1)` inside or right before the shrink loop.
Watch for (Interview Traps)
- Shrinking with `if` instead of `while` when multiple elements must be evicted to restore validity
- Forgetting to `del counts[key]` when count drops to 0 (leaving a 0 entry distorts len(counts))
- Updating the answer at the wrong time (before vs after shrink loop depending on min vs max window)
Dynamic Sliding Window (Flexible / At Most K)
from collections import defaultdict
def sliding_window_at_most_k(s: str, k: int) -> int:
counts = defaultdict(int)
left = 0
max_len = 0
for right in range(len(s)):
# 1. Expand window: include s[right]
counts[s[right]] += 1
# 2. Shrink window: contract from left while invalid
while len(counts) > k: # e.g., at most k distinct characters
counts[s[left]] -= 1
if counts[s[left]] == 0:
del counts[s[left]] # Must remove key to fix len(counts)
left += 1
# 3. Window [left...right] is now guaranteed valid
max_len = max(max_len, right - left + 1)
return max_len- Cost
- O(n) amortized (each item added and removed at most once) · O(k) or O(min(n, alphabet_size)) (State map size bounded by distinct character alphabet (usually <= 26 or 128).)
Canonical problems
#3 Longest Substring Without Repeating Characters: Shrink left until repeated char count drops back to 1
#76 Minimum Window Substring: Expand until all target chars covered, shrink left to minimize length
#209 Minimum Size Subarray Sum: Shrink left while sum >= target to find minimal length
#424 Longest Repeating Character Replacement: Window is valid as long as window_len - max_freq <= k
⌘K
Medium·112 companies·Max freq 100%·Acc 39.4%
PornhubWissen TechnologyPhilips+109
Hard·40 companies·Max freq 100%·Acc 0.5%
Wissen TechnologyNeetCode 150Lyft+37
Medium·25 companies·Max freq 100%·Acc 60.1%
CREDPocket GemsNeetCode 150+22
Medium·22 companies·Max freq 100%·Acc 54.7%
YatraSquarepoint CapitalSamsung+19
Medium·18 companies·Max freq 95%·Acc 49.2%
NeetCode 150NeetCode 150Yandex+15
Hard·18 companies·Max freq 88%·Acc 68.6%
HashedInRobloxSquarepoint Capital+15
Medium·17 companies·Max freq 100%·Acc 57.8%
UberMolocoPhonePe+14
Medium·15 companies·Max freq 88%·Acc 54.1%
SplunkDatabricksRevolut+12
Medium·12 companies·Max freq 100%·Acc 50.1%
CoupangAppDynamicsBitGo+9
Medium·12 companies·Max freq 100%·Acc 45.0%
Pony.aiPony.aiUrban Company+9
Hard·11 companies·Max freq 100%·Acc 70.2%
WinZOPhonePeLyft+8
Medium·11 companies·Max freq 100%·Acc 58.0%
FlipkartPhonePeSprinklr+8
Hard·11 companies·Max freq 88%·Acc 69.2%
MathWorksChubbMorgan Stanley+8
Medium·10 companies·Max freq 100%·Acc 46.4%
BaiduHarnessTikTok+7
Hard·10 companies·Max freq 93%·Acc 34.7%
SamsungTexas InstrumentseBay+7
Medium·10 companies·Max freq 75%·Acc 65.7%
ArcesiumJosh TechnologyByteDance+7
Medium·9 companies·Max freq 75%·Acc 0.5%
RobloxHubspotSalesforce+6
Medium·8 companies·Max freq 100%·Acc 71.3%
YandexVKtcs+5
Hard·8 companies·Max freq 100%·Acc 32.9%
DevRevPhonePeGoldman Sachs+5
Easy·7 companies·Max freq 100%·Acc 64.8%
LiveRampZS AssociatesGoogle+4
Medium·7 companies·Max freq 88%·Acc 51.5%
CitadelNetflixPalantir+4
Easy·7 companies·Max freq 88%·Acc 0.8%
Walmart LabsMorgan StanleyMeta+4
Hard·7 companies·Max freq 63%·Acc 0.5%
UberJuspaytcs+4
Medium·6 companies·Max freq 100%·Acc 56.7%
MakeMyTripCitadelTikTok+3
Hard·6 companies·Max freq 100%·Acc 48.6%
Fractal AnalyticsMicrosoftMeta+3
Medium·6 companies·Max freq 100%·Acc 52.1%
Thomson ReutersRipplingPayPal+3
Easy·6 companies·Max freq 94%·Acc 66.4%
TinkoffAmazonGoogle+3
Medium·6 companies·Max freq 88%·Acc 62.4%
AdobeBloombergMeta+3
Medium·6 companies·Max freq 75%·Acc 74.4%
DE ShawBloombergMicrosoft+3
Hard·6 companies·Max freq 63%·Acc 59.9%
General MotorsMetaGoogle+3
Medium·6 companies·Max freq 50%·Acc 73.4%
LinkedInGoldman SachsAmazon+3
Medium·6 companies·Max freq 50%·Acc 80.4%
UberMicrosoftGoogle+3
Medium·6 companies·Max freq 39%·Acc 62.3%
AmazontcsMicrosoft+3
Easy·5 companies·Max freq 100%·Acc 68.8%
DailyHuntHPGoogle+2
Easy·5 companies·Max freq 100%·Acc 76.9%
QuoraVisaAmazon+2
Hard·5 companies·Max freq 77%·Acc 62.2%
PinterestGoogleMicrosoft+2
Medium·5 companies·Max freq 63%·Acc 53.6%
IBMGoogleMeta+2
Medium·5 companies·Max freq 50%·Acc 59.7%
UberVisaMeta+2
Medium·5 companies·Max freq 39%·Acc 57.1%
TikTokMetaGoogle+2
Easy·5 companies·Max freq 38%·Acc 76.1%
GoogleBloombergMeta+2
Medium·5 companies·Max freq 25%·Acc 61.9%
AmazonBloombergGoogle+2
Hard·4 companies·Max freq 100%·Acc 54.7%
JioAmerican ExpressAmazon+1
Medium·4 companies·Max freq 100%·Acc 50.2%
MitsogoMetaMicrosoft+1
Medium·4 companies·Max freq 100%·Acc 70.2%
ArcesiumMetaAmazon+1
Hard·4 companies·Max freq 100%·Acc 61.5%
TeradataAmazonGoogle+1
Medium·4 companies·Max freq 81%·Acc 36.2%
LTIMindtreeHoneywellRubrik+1
Hard·4 companies·Max freq 67%·Acc 42.4%
TuringMicrosoftGoogle+1
Medium·4 companies·Max freq 63%·Acc 76.0%
TikTokAmazonGoogle+1
Medium·4 companies·Max freq 55%·Acc 47.9%
SalesforceAmazonMeta+1
Medium·4 companies·Max freq 29%·Acc 40.2%
GoogleMetaAmazon+1
Medium·4 companies·Max freq 13%·Acc 62.1%
BloombergMetaGoogle+1
Medium·4 companies·Max freq 13%·Acc 58.5%
MetaAmazonMicrosoft+1
Hard·3 companies·Max freq 100%·Acc 39.4%
Deutsche BankPhonePeGoogle
Medium·3 companies·Max freq 100%·Acc 41.3%
Wells FargoAkuna CapitalYelp
Medium·3 companies·Max freq 92%·Acc 36.1%
LTIMindtreeGoogleAmazon
Medium·3 companies·Max freq 91%·Acc 61.3%
ExpediaTikTokAmazon
Medium·3 companies·Max freq 88%·Acc 38.4%
Palo Alto NetworksMathWorksMicrosoft
Medium·3 companies·Max freq 82%·Acc 61.0%
SprinklrAmazonGoogle
Medium·3 companies·Max freq 38%·Acc 61.8%
GoogleMetaMicrosoft
Medium·3 companies·Max freq 28%·Acc 58.5%
GoogleMetaAmazon
Medium·3 companies·Max freq 25%·Acc 67.7%
AmazonMicrosoftGoogle
Hard·3 companies·Max freq 25%·Acc 53.9%
GoogleAmazonBloomberg
Medium·3 companies·Max freq 13%·Acc 51.5%
BloombergAmazonGoogle
Medium·3 companies·Max freq 13%·Acc 40.7%
BloombergAmazonMicrosoft
Medium·2 companies·Max freq 100%·Acc 44.7%
NutanixGoogle
Medium·2 companies·Max freq 100%·Acc 62.3%
cienaMicrosoft
Medium·2 companies·Max freq 63%·Acc 39.3%
RubrikGoogle
Hard·2 companies·Max freq 25%·Acc 24.9%
GoogleMicrosoft
Medium·1 companies·Max freq 75%·Acc 50.1%
DE Shaw
Medium·1 companies·Max freq 63%·Acc 56.5%
Salesforce
Medium·1 companies·Max freq 25%·Acc 76.5%
Amazon
Medium·1 companies·Max freq 25%·Acc 36.9%
Google
Medium·1 companies·Max freq 13%·Acc 43.4%
Amazon
Medium·1 companies·Max freq 13%·Acc 32.0%
Amazon
Medium·1 companies·Max freq 5%·Acc 0.4%
Google
# | Problem | Difficulty | Top Companies↓ | Frequency | Acceptance | |
|---|---|---|---|---|---|---|
| #3 | Longest Substring Without Repeating Characters Hash TableStringSliding Window | Medium | 100% | 39.4% | ||
| #239 | Sliding Window Maximum ArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query | Hard | 100% | 49.0% | ||
| #76 | Minimum Window Substring Hash TableStringSliding Window | Hard | 100% | 0.5% | ||
| #424 | Longest Repeating Character Replacement Hash TableStringSliding Window | Medium | 100% | 60.1% | ||
| #713 | Subarray Product Less Than K ArrayBinary SearchSliding WindowPrefix Sum | Medium | 100% | 54.7% | ||
| #1004 | Max Consecutive Ones III ArrayBinary SearchSliding WindowPrefix Sum | Medium | 88% | 68.0% | ||
| #658 | Find K Closest Elements ArrayTwo PointersBinary SearchSliding WindowSortingHeap (Priority Queue) | Medium | 88% | 49.9% | ||
| #209 | Minimum Size Subarray Sum ArrayBinary SearchSliding WindowPrefix Sum | Medium | 88% | 52.2% | ||
| #567 | Permutation in String Hash TableTwo PointersStringSliding Window | Medium | 95% | 49.2% | ||
| #992 | Subarrays with K Different Integers ArrayHash TableSliding WindowCounting | Hard | 88% | 68.6% | ||
| #1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue | Medium | 100% | 57.8% | ||
| #438 | Find All Anagrams in a String Hash TableStringSliding Window | Medium | 88% | 54.1% | ||
| #219 | Contains Duplicate II ArrayHash TableSliding Window | Easy | 78% | 51.5% | ||
| #485 | Easy | 89% | 65.6% | |||
| #904 | Fruit Into Baskets ArrayHash TableSliding Window | Medium | 66% | 51.7% | ||
| #340 | Longest Substring with At Most K Distinct Characters Hash TableStringSliding Window | Medium | 100% | 50.1% | ||
| #1838 | Frequency of the Most Frequent Element ArrayBinary SearchGreedySliding WindowSortingPrefix Sum | Medium | 100% | 45.0% | ||
| #480 | Sliding Window Median ArrayHash TableSliding WindowHeap (Priority Queue)Treap | Hard | 67% | 39.0% | ||
| #632 | Smallest Range Covering Elements from K Lists ArrayHash TableGreedySliding WindowSortingHeap (Priority Queue) | Hard | 100% | 70.2% | ||
| #1423 | Maximum Points You Can Obtain from Cards ArraySliding WindowPrefix Sum | Medium | 100% | 58.0% | ||
| #2444 | Count Subarrays With Fixed Bounds ArrayQueueSliding WindowMonotonic Queue | Hard | 88% | 69.2% | ||
| #395 | Longest Substring with At Least K Repeating Characters Hash TableStringDivide and ConquerSliding Window | Medium | 100% | 46.4% | ||
| #30 | Substring with Concatenation of All Words Hash TableStringSliding Window | Hard | 93% | 34.7% | ||
| #2134 | Minimum Swaps to Group All 1's Together II ArraySliding Window | Medium | 75% | 65.7% | ||
| #1297 | Maximum Number of Occurrences of a Substring Hash TableStringSliding Window | Medium | 75% | 0.5% | ||
| #1248 | Count Number of Nice Subarrays ArrayHash TableMathSliding WindowPrefix Sum | Medium | 75% | 75.4% | ||
| #1493 | Longest Subarray of 1's After Deleting One Element ArrayDynamic ProgrammingSliding Window | Medium | 100% | 71.3% | ||
| #862 | Shortest Subarray with Sum at Least K ArrayBinary SearchQueueSliding WindowHeap (Priority Queue)Prefix SumMonotonic Queue | Hard | 100% | 32.9% | ||
| #220 | Contains Duplicate III ArraySliding WindowSortingBucket SortOrdered Set | Hard | 88% | 24.9% | ||
| #1052 | Grumpy Bookstore Owner ArraySliding Window | Medium | 100% | 64.1% | ||
| #594 | Longest Harmonious Subsequence ArrayHash TableSliding WindowSortingCounting | Easy | 100% | 64.8% | ||
| #413 | Arithmetic Slices ArrayDynamic ProgrammingSliding Window | Medium | 100% | 64.8% | ||
| #1695 | Maximum Erasure Value ArrayHash TableSliding Window | Medium | 100% | 64.4% | ||
| #718 | Maximum Length of Repeated Subarray ArrayBinary SearchDynamic ProgrammingSliding WindowRolling HashHash Function | Medium | 88% | 51.5% | ||
| #1044 | Longest Duplicate Substring StringBinary SearchSliding WindowRolling HashSuffix ArrayHash FunctionSuffix AutomatonSuffix TreeZ AlgorithmBoyer–Moore String-Search Algorithm | Hard | 88% | 31.3% | ||
| #3090 | Maximum Length Substring With Two Occurrences Hash TableStringSliding Window | Easy | 88% | 0.8% | ||
| #187 | Repeated DNA Sequences Hash TableStringBit ManipulationSliding WindowRolling HashHash FunctionZ AlgorithmBoyer–Moore String-Search Algorithm | Medium | 81% | 53.6% | ||
| #2009 | Minimum Number of Operations to Make Array Continuous ArrayHash TableBinary SearchSliding Window | Hard | 63% | 0.5% | ||
| #2537 | Count the Number of Good Subarrays ArrayHash TableSliding Window | Medium | 50% | 65.7% | ||
| #930 | Binary Subarrays With Sum ArrayHash TableSliding WindowPrefix Sum | Medium | 41% | 69.3% | ||
| #3208 | Alternating Groups II ArraySliding Window | Medium | 100% | 0.6% | ||
| #1610 | Maximum Number of Visible Points ArrayMathGeometrySliding WindowSorting | Hard | 100% | 38.3% | ||
| #2958 | Length of Longest Subarray With at Most K Frequency ArrayHash TableSliding Window | Medium | 100% | 56.7% | ||
| #2401 | Longest Nice Subarray ArrayBit ManipulationSliding Window | Medium | 100% | 64.8% | ||
| #3445 | Maximum Difference Between Even and Odd Frequency II StringSliding WindowEnumerationPrefix Sum | Hard | 100% | 48.6% | ||
| #1839 | Longest Substring Of All Vowels in Order StringSliding Window | Medium | 100% | 52.1% | ||
| #1984 | Minimum Difference Between Highest and Lowest of K Scores ArraySliding WindowSorting | Easy | 94% | 66.4% | ||
| #2962 | Count Subarrays Where Max Element Appears at Least K Times ArraySliding Window | Medium | 88% | 62.4% | ||
| #1358 | Number of Substrings Containing All Three Characters Hash TableStringSliding Window | Medium | 75% | 74.4% | ||
| #1652 | Defuse the Bomb ArraySliding Window | Easy | 67% | 79.4% | ||
| #689 | Maximum Sum of 3 Non-Overlapping Subarrays ArrayDynamic ProgrammingSliding WindowPrefix Sum | Hard | 63% | 59.9% | ||
| #1343 | Medium | 50% | 73.4% | |||
| #3191 | Minimum Operations to Make Binary Array Elements Equal to One I ArrayBit ManipulationQueueSliding WindowPrefix Sum | Medium | 50% | 80.4% | ||
| #1456 | Maximum Number of Vowels in a Substring of Given Length StringSliding Window | Medium | 39% | 62.3% | ||
| #2379 | Minimum Recolors to Get K Consecutive Black Blocks StringSliding Window | Easy | 100% | 68.8% | ||
| #1876 | Substrings of Size Three with Distinct Characters Hash TableStringSliding WindowCounting | Easy | 100% | 76.9% | ||
| #727 | Minimum Window Subsequence StringDynamic ProgrammingSliding Window | Hard | 89% | 43.8% | ||
| #2302 | Count Subarrays With Score Less Than K ArrayBinary SearchSliding WindowPrefix Sum | Hard | 77% | 62.2% | ||
| #1888 | Minimum Number of Flips to Make the Binary String Alternating StringDynamic ProgrammingSliding Window | Medium | 63% | 53.6% | ||
| #3652 | Best Time to Buy and Sell Stock using Strategy ArraySliding WindowPrefix Sum | Medium | 50% | 59.7% | ||
| #159 | Longest Substring with At Most Two Distinct Characters Hash TableStringSliding Window | Medium | 39% | 57.1% | ||
| #2762 | Continuous Subarrays ArrayQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue | Medium | 38% | 58.0% | ||
| #3318 | Find X-Sum of All K-Long Subarrays I ArrayHash TableSliding WindowHeap (Priority Queue) | Easy | 38% | 76.1% | ||
| #837 | New 21 Game MathDynamic ProgrammingSliding WindowProbability and Statistics | Medium | 30% | 51.9% | ||
| #2411 | Smallest Subarrays With Maximum Bitwise OR ArrayBinary SearchBit ManipulationSliding Window | Medium | 25% | 61.9% | ||
| #3013 | Divide an Array Into Subarrays With Minimum Cost II ArrayHash TableSliding WindowHeap (Priority Queue) | Hard | 100% | 54.7% | ||
| #3097 | Shortest Subarray With OR at Least K II ArrayBit ManipulationSliding Window | Medium | 100% | 50.2% | ||
| #2024 | Maximize the Confusion of an Exam StringBinary SearchSliding WindowPrefix Sum | Medium | 100% | 70.2% | ||
| #2528 | Maximize the Minimum Powered City ArrayBinary SearchGreedyQueueSliding WindowPrefix Sum | Hard | 100% | 61.5% | ||
| #2090 | K Radius Subarray Averages ArraySliding Window | Medium | 88% | 46.4% | ||
| #2747 | Count Zero Request Servers ArrayHash TableSliding WindowSorting | Medium | 81% | 36.2% | ||
| #1703 | Minimum Adjacent Swaps for K Consecutive Ones ArrayGreedySliding WindowPrefix Sum | Hard | 67% | 42.4% | ||
| #2799 | Count Complete Subarrays in an Array ArrayHash TableSliding Window | Medium | 63% | 76.0% | ||
| #3634 | Minimum Removals to Balance Array ArrayBinary SearchSliding WindowSorting | Medium | 55% | 47.9% | ||
| #1763 | Longest Nice Substring Hash TableStringDivide and ConquerBit ManipulationSliding Window | Easy | 38% | 64.5% | ||
| #3346 | Maximum Frequency of an Element After Performing Operations I ArrayBinary SearchSliding WindowSortingPrefix Sum | Medium | 29% | 40.2% | ||
| #487 | Max Consecutive Ones II ArrayDynamic ProgrammingSliding Window | Medium | 27% | 52.1% | ||
| #1871 | Jump Game VII StringDynamic ProgrammingSliding WindowPrefix Sum | Medium | 25% | 35.6% | ||
| #3254 | Find the Power of K-Size Subarrays I ArraySliding Window | Medium | 13% | 62.1% | ||
| #3578 | Count Partitions With Max-Min Difference at Most K ArrayDynamic ProgrammingQueueSliding WindowPrefix SumMonotonic Queue | Medium | 13% | 58.5% | ||
| #2269 | Find the K-Beauty of a Number MathStringSliding Window | Easy | 100% | 63.6% | ||
| #2968 | Apply Operations to Maximize Frequency Score ArrayBinary SearchSliding WindowSortingPrefix Sum | Hard | 100% | 39.4% | ||
| #3206 | Alternating Groups I ArraySliding Window | Easy | 100% | 69.3% | ||
| #2904 | Shortest and Lexicographically Smallest Beautiful String StringSliding Window | Medium | 100% | 41.3% | ||
| #2271 | Maximum White Tiles Covered by a Carpet ArrayBinary SearchGreedySliding WindowSortingPrefix Sum | Medium | 92% | 36.1% | ||
| #1151 | Minimum Swaps to Group All 1's Together ArraySliding Window | Medium | 91% | 61.3% | ||
| #2831 | Find the Longest Equal Subarray ArrayHash TableBinary SearchSliding Window | Medium | 88% | 38.4% | ||
| #1031 | Maximum Sum of Two Non-Overlapping Subarrays ArrayDynamic ProgrammingSliding Window | Medium | 82% | 61.0% | ||
| #2981 | Find Longest Special Substring That Occurs Thrice I Hash TableStringBinary SearchSliding WindowCounting | Medium | 38% | 61.8% | ||
| #2653 | Sliding Subarray Beauty ArrayHash TableSliding Window | Medium | 31% | 0.4% | ||
| #2779 | Maximum Beauty of an Array After Applying Operation ArrayBinary SearchSliding WindowSorting | Medium | 28% | 58.5% | ||
| #2110 | Number of Smooth Descent Periods of a Stock ArrayMathTwo PointersDynamic ProgrammingSliding Window | Medium | 25% | 67.7% | ||
| #2781 | Length of the Longest Valid Substring ArrayHash TableStringSliding Window | Hard | 25% | 38.6% | ||
| #3347 | Maximum Frequency of an Element After Performing Operations II ArrayBinary SearchSliding WindowSortingPrefix Sum | Hard | 25% | 53.9% | ||
| #995 | Minimum Number of K Consecutive Bit Flips ArrayBit ManipulationQueueSliding WindowPrefix SumBrute-Force Search | Hard | 16% | 0.6% | ||
| #2516 | Take K of Each Character From Left and Right Hash TableStringSliding Window | Medium | 13% | 51.5% | ||
| #3306 | Count of Substrings Containing Every Vowel and K Consonants II Hash TableStringSliding Window | Medium | 13% | 40.7% | ||
| #978 | Longest Turbulent Subarray ArrayDynamic ProgrammingSliding Window | Medium | 13% | 49.3% | ||
| #1156 | Swap For Longest Repeated Character Substring Hash TableStringSliding Window | Medium | 100% | 44.7% | ||
| #2107 | Number of Unique Flavors After Sharing K Candies ArrayHash TableSliding Window | Medium | 100% | 62.3% | ||
| #1425 | Constrained Subsequence Sum ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue | Hard | 100% | 56.5% | ||
| #2398 | Maximum Number of Robots Within Budget ArrayBinary SearchQueueSliding WindowHeap (Priority Queue)Prefix SumMonotonic Queue | Hard | 67% | 38.8% | ||
| #2982 | Find Longest Special Substring That Occurs Thrice II Hash TableStringBinary SearchSliding WindowCounting | Medium | 63% | 39.3% | ||
| #3413 | Maximum Coins From K Consecutive Bags ArrayBinary SearchGreedySliding WindowSortingPrefix Sum | Medium | 47% | 25.7% | ||
| #3134 | Find the Median of the Uniqueness Array ArrayHash TableBinary SearchSliding Window | Hard | 27% | 30.5% | ||
| #3420 | Count Non-Decreasing Subarrays After K Operations ArrayStackSegment TreeQueueSliding WindowMonotonic StackMonotonic Queue | Hard | 25% | 24.9% | ||
| #2760 | Longest Even Odd Subarray With Threshold ArraySliding Window | Easy | 13% | 32.3% | ||
| #3321 | Find X-Sum of All K-Long Subarrays II ArrayHash TableSliding WindowHeap (Priority Queue) | Hard | 13% | 41.2% | ||
| #2932 | Maximum Strong Pair XOR I ArrayHash TableBit ManipulationTrieSliding Window | Easy | 100% | 76.3% | ||
| #2935 | Maximum Strong Pair XOR II ArrayHash TableBit ManipulationTrieSliding Window | Hard | 100% | 33.2% | ||
| #3095 | Shortest Subarray With OR at Least K I ArrayBit ManipulationSliding Window | Easy | 100% | 44.8% | ||
| #1234 | Replace the Substring for Balanced String StringSliding Window | Medium | 100% | 41.1% | ||
| #2953 | Count Complete Substrings Hash TableStringSliding Window | Hard | 100% | 30.9% | ||
| #2875 | Minimum Size Subarray in Infinite Array ArrayHash TableSliding WindowPrefix Sum | Medium | 77% | 32.4% | ||
| #2524 | Maximum Frequency Score of a Subarray ArrayHash TableMathStackSliding Window | Hard | 76% | 36.1% | ||
| #3323 | Minimize Connected Groups by Inserting Interval ArrayBinary SearchSliding WindowSorting | Medium | 75% | 50.1% | ||
| #2067 | Number of Equal Count Substrings Hash TableStringSliding WindowCounting | Medium | 64% | 45.6% | ||
| #3086 | Minimum Moves to Pick K Ones ArrayGreedySliding WindowPrefix Sum | Hard | 63% | 21.8% | ||
| #3135 | Equalize Strings by Adding or Removing Characters at Ends StringBinary SearchDynamic ProgrammingSliding WindowHash Function | Medium | 63% | 56.5% | ||
| #2743 | Count Substrings Without Repeating Character Hash TableStringSliding Window | Medium | 51% | 75.9% | ||
| #2555 | Maximize Win From Two Segments ArrayBinary SearchSliding Window | Medium | 50% | 38.0% | ||
| #3023 | Find Pattern in Infinite Stream I ArraySliding WindowRolling HashString MatchingInteractiveHash Function | Medium | 50% | 57.4% | ||
| #3037 | Find Pattern in Infinite Stream II ArraySliding WindowRolling HashString MatchingInteractiveHash Function | Hard | 50% | 67.8% | ||
| #1040 | Moving Stones Until Consecutive II ArrayMathSliding WindowSorting | Medium | 25% | 59.0% | ||
| #1100 | Find K-Length Substrings With No Repeated Characters Hash TableStringSliding Window | Medium | 25% | 76.5% | ||
| #1176 | Diet Plan Performance ArraySliding Window | Easy | 25% | 56.1% | ||
| #1852 | Distinct Numbers in Each Subarray ArrayHash TableSliding Window | Medium | 25% | 77.4% | ||
| #2841 | Maximum Sum of Almost Unique Subarray ArrayHash TableSliding Window | Medium | 25% | 41.4% | ||
| #1499 | Max Value of Equation ArrayQueueSliding WindowHeap (Priority Queue)Monotonic Queue | Hard | 25% | 45.1% | ||
| #683 | K Empty Slots ArrayBinary Indexed TreeSegment TreeQueueSliding WindowHeap (Priority Queue)Ordered SetMonotonic Queue | Hard | 25% | 38.0% | ||
| #1477 | Find Two Non-overlapping Sub-arrays Each With Target Sum ArrayHash TableBinary SearchDynamic ProgrammingSliding Window | Medium | 25% | 36.9% | ||
| #1918 | Kth Smallest Subarray Sum ArrayBinary SearchSliding Window | Medium | 25% | 53.4% | ||
| #2260 | Minimum Consecutive Cards to Pick Up ArrayHash TableSliding Window | Medium | 25% | 53.9% | ||
| #3297 | Count Substrings That Can Be Rearranged to Contain a String I Hash TableStringSliding Window | Medium | 13% | 43.4% | ||
| #3795 | Minimum Subarray Length With Distinct Sum At Least K ArrayHash TableSliding Window | Medium | 13% | 32.0% | ||
| #3969 | Valid Subarrays With Matching Sum Digits I ArrayHash TableSliding WindowEnumerationPrefix Sum | Medium | 13% | 46.7% | ||
| #3411 | Maximum Subarray With Equal Products ArrayMathSliding WindowEnumerationNumber Theory | Easy | 13% | 47.0% | ||
| #3325 | Count Substrings With K-Frequency Characters I Hash TableStringSliding Window | Medium | 13% | 56.2% | ||
| #3589 | Count Prime-Gap Balanced Subarrays ArrayMathQueueSliding WindowNumber TheoryMonotonic Queue | Medium | 13% | 23.7% | ||
| #2156 | Find Substring With Given Hash Value StringSliding WindowRolling HashHash Function | Hard | 13% | 26.5% | ||
| #3859 | Count Subarrays With K Distinct Integers ArrayHash TableSliding WindowCounting | Hard | 5% | 0.2% | ||
| #3305 | Count of Substrings Containing Every Vowel and K Consonants I Hash TableStringSliding Window | Medium | 5% | 0.4% |
Showing 142 of 142 problems in Sliding WindowFiltered: All Companies