Leetcode Problem 1456. Maximum Number of Vowels in a Substring of Given Length

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

Leetcode Solutions

Create a set vowels containing all vowel characters: 'a', 'e', 'i', 'o', 'u'.
Initialize max_vowels to 0, which will hold the maximum number of vowels found in any substring of length k.
Initialize current_vowels to 0, which will hold the number of vowels in the current window.
Iterate through the first k characters of s and increment current_vowels for each vowel encountered.
Set max_vowels to current_vowels as the initial maximum.
Iterate through the string s starting from the k-th character to the end:
- If the character entering the window (s[i]) is a vowel, increment current_vowels.
- If the character leaving the window (s[i - k]) is a vowel, decrement current_vowels.
- Update max_vowels with the maximum of max_vowels and current_vowels.
Return max_vowels as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen