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

Given string s and integer k, return the maximum number of vowels ('a','e','i','o','u') contained in any contiguous substring of length k. The core challenge is scanning s with a fixed-size sliding window to maintain and update the vowel count efficiently (n up to 1e5).