Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1456 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1456 # by problem number
lcpy gen -s maximum_number_of_vowels_in_a_substring_of_given_length # by problem name
s and an integer k, return the maximum number of vowel letters in any substring of s with length k.
Vowel letters in English are 'a', 'e', 'i', 'o', and 'u'.
Input: s = "abciiidef", k = 3
Output: 3
Input: s = "aeiou", k = 2
Output: 2
Input: s = "leetcode", k = 3
Output: 2
class Solution:
# Time: O(n)
# Space: O(1)
def max_vowels(self, s: str, k: int) -> int:
vowels = frozenset("aeiou")
count = sum(c in vowels for c in s[:k])
best = count
for i in range(k, len(s)):
count += (s[i] in vowels) - (s[i - k] in vowels)
if count > best:
best = count
if best == k:
return best
return best
| Time | Space |
|---|---|
| O(n) | O(1) |