Loading pattern...

© 2026 FrontendX. All rights reserved.

Problems/Sliding Window

Sliding Window

Process contiguous subarrays/substrings efficiently by maintaining a dynamic window that expands and contracts.

19Total

1First Negative Number in Every Window of Size K

2Best Time to Buy and Sell Stock

3Maximum Number of Vowels in a Substring of Given Length

4Longest Substring Without Repeating Characters

5Longest Repeating Character Replacement

6Count Number of Nice Subarrays

7Subarray Sum Equals K

8Get Equal Substrings Within Budget

9Longest Subarray With Frequency Limit

10Maximum Frequency of Any Element in a Window

11Fixed Window Circular Sum

12Minimum Window Substring

13Sliding Window Maximum

14Maximum Sum of 3 Non-Overlapping Subarrays

1Maximum Sum Subarray of Size K

2Subarrays with K Different Integers

3Maximum Consecutive Ones

4Minimum Recolor Window

5Number of Distinct Substrings in a String