Skip to content

problem20.md

Latest commit

 

History

History
14 lines (11 loc) · 465 Bytes

problem20.md

File metadata and controls

14 lines (11 loc) · 465 Bytes

Problem 20: Vowel Density Search (Maximum Number of Vowels in a Substring of Given Length)

Problem Statement

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'.

Input Format

  • A string s.
  • An integer k.

Example

Input: s = "abciiidef", k = 3
Output: 3 Explanation: The substring "iii" contains 3 vowels.