•PRACTICE

Sliding Window Interview Questions

21 Sliding Window problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Filter by company

Clear all ✕
Adobe (1)Amazon (7)Apple (3)Atlassian (2)Databricks (1)Google (3)Meta (6)Microsoft (5)Netflix (4)Oracle (2)Rippling (2)Salesforce (3)Uber (2)Walmart (5)

Filter by topic

Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
🔒

to save your progress.

✓ 0ProblemDifficultyCompaniesBreakdown / SolutionLeetCode
Longest Substring Without Repeating CharactersMedium11 companiesView breakdown →
Find All Anagrams in a StringMedium6 companiesView breakdown →
Permutation in StringMedium3 companiesView breakdown →
Minimum Window SubstringHard4 companiesView breakdown →
Sliding Window MaximumHard3 companiesView breakdown →
Fruit Into BasketsMedium3 companiesView breakdown →
Longest Repeating Character ReplacementMedium1 companiesView breakdown →
Contains Duplicate IIEasy2 companiesView breakdown →
Longest Substring Of All Vowels in OrderMedium1 companiesView breakdown →
Contains Duplicate IIIHard1 companiesView breakdown →
Count Subarrays With Fixed BoundsHard1 companiesView breakdown →
Find K Closest ElementsMEDIUM1 companiesView breakdown →
Longest Continuous Subarray With Absolute Diff Less Than or Equal to LimitMEDIUM1 companiesView breakdown →
Max Consecutive Ones IIIMEDIUM1 companiesView breakdown →
Maximum Average Subarray IEASY1 companiesView breakdown →
Minimum Size Subarray SumMEDIUM1 companiesView breakdown →
Maximum Sum of Distinct Subarrays With Length KMEDIUM1 companiesView breakdown →
Maximum Length Substring With Two OccurrencesEASY1 companiesView breakdown →
Minimum Removals to Balance ArrayMEDIUM1 companiesView breakdown →
Maximum Coins From K Consecutive BagsMEDIUM1 companiesView breakdown →
Subarray Product Less Than KMEDIUM1 companiesView breakdown →

Practice with a Mock Interview

Solve these Sliding Window problems under real interview pressure with our AI interviewer.

Start Mock Interview →