Maximum vowels in window
Given a string s and integer k, return the maximum number of vowels (a, e, i, o, u) in any substring of length exactly k. If k > len(s) return 0. Constraints: 1 <= len(s) <= 10^5, 1 <= k, s is lowercase letters.
Implement
max_vowels_window(s: str, k: int) → intExamples
in
["abciiidef",3]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 18 min
solution.py
InputExpectedGot
["abciiidef",3]3not run yetsample