LeetCode 1456: Maximum Number of Vowels in a Substring of Given Length Solution

Master LeetCode problem 1456 (Maximum Number of Vowels in a Substring of Given Length), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

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

Medium

String Sliding Window

Problem Explanation

Explanation:

To solve this problem, we can use a sliding window approach. We will iterate through the string s with a window size of k, counting the number of vowels in each window. We will keep track of the maximum number of vowels found in any window and return this maximum count at the end.

Here is the step-by-step algorithm:

Initialize variables maxVowels and curVowels to track the maximum number of vowels and current number of vowels in the window respectively.
Iterate through the first k characters of the string s and count the number of vowels in this initial window.
Update maxVowels with the count of vowels in the initial window.
Slide the window by removing the leftmost character and adding the next character in the string.
Update the count of vowels in the window by subtracting the leftmost character if it was a vowel and adding the new character if it is a vowel.
Update maxVowels if the count of vowels in the current window is greater than maxVowels.
Repeat steps 4-6 until the end of the string is reached.
Return the maxVowels found.

Solution Code

class Solution {
    public int maxVowels(String s, int k) {
        int maxVowels = 0;
        int curVowels = 0;
        String vowels = "aeiou";

        for (int i = 0; i < k; i++) {
            if (vowels.contains(String.valueOf(s.charAt(i)))) {
                curVowels++;
            }
        }

        maxVowels = curVowels;

        for (int i = k; i < s.length(); i++) {
            if (vowels.contains(String.valueOf(s.charAt(i - k)))) {
                curVowels--;
            }
            if (vowels.contains(String.valueOf(s.charAt(i)))) {
                curVowels++;
            }
            maxVowels = Math.max(maxVowels, curVowels);
        }

        return maxVowels;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1456 (Maximum Number of Vowels in a Substring of Given Length)?

This page provides optimized solutions for LeetCode problem 1456 (Maximum Number of Vowels in a Substring of Given Length) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1456 (Maximum Number of Vowels in a Substring of Given Length)?

The time complexity for LeetCode 1456 (Maximum Number of Vowels in a Substring of Given Length) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1456 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1456 in Java, C++, or Python.

Back to LeetCode Solutions