Sliding Window Maximum

Category: Heap / Priority Queue

Difficulty: advanced

Description: Find max in each window

Time Complexity: O(n)

Space Complexity: O(k)

Related LeetCode Problems

• 239. Sliding Window Maximum (Hard)
• 480. Sliding Window Median (Hard)
• 438. Find All Anagrams in a String (Medium)
• 567. Permutation in String (Medium)
• 3. Longest Substring Without Repeating Characters (Medium)
• 76. Minimum Window Substring (Hard)
• 295. Find Median from Data Stream (Hard)
• 1004. Max Consecutive Ones III (Medium)
• 424. Longest Repeating Character Replacement (Medium)
• 643. Maximum Average Subarray I (Easy)
• 1456. Maximum Number of Vowels in a Substring of Given Length (Medium)
• 2391. Minimum Amount of Time to Collect Garbage (Medium)
• 1358. Number of Substrings Containing All Three Characters (Medium)
• 930. Binary Subarrays With Sum (Medium)