Medium

Quiz

#1456 Maximum Number of Vowels in a Substring of Given Length

APPROACH

Given a string s and an integer k, determine the maximum number of vowels ('a', 'e', 'i', 'o', 'u') that appear in any contiguous substring of s that has exactly k characters.

Example 1:

Input: s = "abciiidef", k = 3

Output: 3

Explanation: The substring "iii" contains 3 vowel letters.

Example 2:

Input: s = "aeiou", k = 2

Output: 2

Explanation: Any substring of length 2 contains 2 vowels.

Example 3:

Input: s = "leetcode", k = 3

Output: 2

Explanation: "lee", "eet" and "ode" contain 2 vowels.

1 of 4

1:00

What is the optimal approach for this problem?