dsa1 min read
Maximum Number of Vowels in a Substring of Given Length [Medium]
Find the maximum number of vowels in any substring of length k using a fixed sliding window with vowel count.
Read →
webcoderspeed.com
1276 articles
Find the maximum number of vowels in any substring of length k using a fixed sliding window with vowel count.
Find minimum swaps to group all 1s together in a circular binary array using a fixed-size sliding window equal to the count of 1s.
Find minimum minutes to collect at least k of each character from ends by finding the longest middle window that can be excluded.
Maximize customer satisfaction by finding the best k-minute window for the bookstore owner to stay non-grumpy.
Find the minimum difference between the max and min of any k scores by sorting and using a fixed window of size k.