LeetCode 1100: Find K-Length Substrings With No Repeated Characters
A clear explanation of counting substrings of length k with all unique characters using a sliding window.
Tag
Sliding-Window
42 notes
LeetCode 1052: Grumpy Bookstore Owner
A clear explanation of maximizing satisfied customers by choosing the best window for the owner to not be grumpy using a sliding window.
LeetCode 1044: Longest Duplicate Substring
A clear explanation of finding the longest duplicate substring using binary search on length combined with Rabin-Karp rolling hash.
LeetCode 1040: Moving Stones Until Consecutive II
A clear explanation of finding minimum and maximum moves to make stones consecutive using a sliding window.
LeetCode 1031: Maximum Sum of Two Non-Overlapping Subarrays
A clear explanation of finding two non-overlapping subarrays with maximum combined sum using prefix sums and running maximums.
LeetCode 1004: Max Consecutive Ones III
A clear explanation of finding the longest subarray of ones by flipping at most k zeros using a sliding window.
LeetCode 837: New 21 Game
A clear explanation of the New 21 Game problem using probability dynamic programming and a sliding window sum.
LeetCode 904: Fruit Into Baskets
A clear explanation of Fruit Into Baskets using a sliding window with at most two distinct fruit types.
LeetCode 995: Minimum Number of K Consecutive Bit Flips
A clear explanation of making all bits equal to 1 using greedy left-to-right flips and a sliding window flip parity.
LeetCode 992: Subarrays with K Different Integers
A clear explanation of counting subarrays with exactly k distinct integers using the at-most-k sliding window trick.
LeetCode 978: Longest Turbulent Subarray
A clear explanation of finding the longest subarray whose adjacent comparisons alternate between greater-than and less-than.
LeetCode 933: Number of Recent Calls
A clear explanation of solving Number of Recent Calls using a queue as a sliding time window.
LeetCode 930: Binary Subarrays With Sum
A clear explanation of solving Binary Subarrays With Sum using prefix sums and a frequency map.
LeetCode 795: Number of Subarrays with Bounded Maximum
A clear explanation of counting contiguous subarrays whose maximum value lies inside a given inclusive range.
LeetCode 713: Subarray Product Less Than K
A clear explanation of counting contiguous subarrays whose product is less than k using a sliding window.
LeetCode 689: Maximum Sum of 3 Non-Overlapping Subarrays
Find three non-overlapping subarrays of length k with maximum total sum and return the lexicographically smallest starting indices.
LeetCode 683: K Empty Slots
Find the earliest day when two turned-on bulbs have exactly k turned-off bulbs between them using a sliding window over bloom days.
LeetCode 674: Longest Continuous Increasing Subsequence
A clear explanation of finding the longest strictly increasing contiguous subarray using a single scan.
LeetCode 658: Find K Closest Elements
A clear explanation of finding the k closest elements to a target using binary search and a sliding window.
LeetCode 643: Maximum Average Subarray I
A sliding window solution for finding the maximum average among all contiguous subarrays of fixed length k.
LeetCode 632: Smallest Range Covering Elements from K Lists
A heap-based solution for finding the smallest range that contains at least one number from each sorted list.
LeetCode 239: Sliding Window Maximum
A clear explanation of finding the maximum value in every sliding window using a monotonic deque.
LeetCode 567: Permutation in String
A clear explanation of Permutation in String using a fixed-size sliding window and character frequency counts.
LeetCode 487: Max Consecutive Ones II
A clear explanation of finding the longest run of 1s after flipping at most one 0 using a sliding window.
LeetCode 480: Sliding Window Median
A clear explanation of maintaining the median of each fixed-size window using two heaps and lazy deletion.
LeetCode 438: Find All Anagrams in a String
Find all starting indices where an anagram of p appears in s using a fixed-size sliding window.
LeetCode 424: Longest Repeating Character Replacement
A clear explanation of finding the longest substring that can become all one letter using a sliding window.
LeetCode 395: Longest Substring with At Least K Repeating Characters
A clear explanation of finding the longest substring where every character appears at least k times using divide and conquer.
LeetCode 346: Moving Average from Data Stream
A clear explanation of Moving Average from Data Stream using a queue and rolling sum.
LeetCode 340: Longest Substring with At Most K Distinct Characters
A clear explanation of Longest Substring with At Most K Distinct Characters using a sliding window and character counts.
LeetCode 220: Contains Duplicate III
A clear explanation of checking nearby indices with nearby values using a sliding window and bucket hashing.
LeetCode 219: Contains Duplicate II
A clear explanation of detecting whether equal values appear within distance k using a hash map or sliding window set.
LeetCode 209: Minimum Size Subarray Sum
A clear explanation of finding the shortest contiguous subarray whose sum is at least target using a sliding window.
LeetCode 76: Minimum Window Substring
A detailed guide to solving Minimum Window Substring with a sliding window and frequency counters.
LeetCode 187: Repeated DNA Sequences
A clear explanation of finding repeated 10-letter DNA substrings using a fixed-size sliding window and hash sets.
LeetCode 159: Longest Substring with At Most Two Distinct Characters
A clear explanation of finding the longest substring with at most two distinct characters using a sliding window.
LeetCode 30: Substring with Concatenation of All Words
A clear explanation of finding all starting indices where a substring is formed by concatenating every word exactly once.
LeetCode 3: Longest Substring Without Repeating Characters
A clear explanation of the longest substring problem using sliding window and a hash set.
Sliding Window Array
Maintain a contiguous window over an array while moving its left and right boundaries.
Rolling Median Sort
Maintain the median of a sliding window using two heaps while the window moves over a stream.
Sliding Window Sort
Maintain sorted order over a moving window of the most recent elements in a stream.
5.11 Rolling Hashes
Compute hash values for sliding windows over a sequence in constant time by incrementally updating rather than recomputing.