Maximum Number of Vowels in a Substring of Given Length

Given a string s consisting of lowercase English letters and an integer k, find the maximum number of vowels (a, e, i, o, u) in any contiguous substring of s with length k, and return that m...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: