Skip to content

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

Difficulty Topics

Description

Given a string 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'.

 

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.

 

Constraints:

  • 1 <= s.length <= 105
  • s consists of lowercase English letters.
  • 1 <= k <= s.length

Solution

maximum-number-of-vowels-in-a-substring-of-given-length.py
class Solution:
    def maxVowels(self, S: str, k: int) -> int:
        d = {"a","e","i","o","u"}

        c = res = 0

        for i, s in enumerate(S):
            if s in d:
                c += 1

            if i >= k and S[i-k] in d:
                c -= 1

            res = max(res, c)

        return res