dsa1 min read
Max Consecutive Ones [Medium] — K-Flip Sliding Window
Find the maximum consecutive ones in a binary array when you can flip at most k zeros, identical to the Max Consecutive Ones III pattern.
Read →
All Posts
1276 articles
dsa1 min read
Sort Vowels in a String [Medium] — Extraction and Replace
Sort only the vowels in a string while keeping consonants in place by extracting vowels, sorting, then reinserting.
Read →
dsa2 min read
Minimum Window Subsequence [Hard] — Forward + Backward Two Ptr
Find the minimum window in s that contains t as a subsequence by using a forward pass to find a valid window then backward pass to minimize it.
Read →
dsa2 min read
Count Subarrays Where Median Equals K [Hard] — Prefix Balance
Count subarrays where the median is exactly k by converting the problem to counting balanced prefix sequences around k.
Read →
dsa2 min read
Sliding Window Median [Hard] — Two Heaps with Lazy Deletion
Find the median of each sliding window of size k using two heaps (max-heap for lower half, min-heap for upper half) with lazy deletion.
Read →
Page 125 of 256