D. J.:

- Added the leetcode problem and solution for 1456

Author: nobodyPerfecZ

README.md

@@ -263,6 +263,7 @@
 - [1143 Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/)
 - [1218 Longest Arithmetic Subsequence of Given Difference](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/)
 - [1312 Minimum Insertion Steps to Make a String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/description/)
+- [1456 Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/)
 - [1534 Count Good Triplets](https://leetcode.com/problems/count-good-triplets/description/)
 - [1679 Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/description/)
 - [1732 Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/description/)

awesome_python_leetcode/_1456_maximum_number_of_vowels_in_a_substring_of_given_length.py

@@ -0,0 +1,30 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def maxVowels(self, s: str, k: int) -> int:
+        """
+        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'.
+        """
+        # Count initial sliding window
+        curr = 0
+        for i in range(k):
+            if s[i] in ["a", "e", "i", "o", "u"]:
+                curr += 1
+        result = curr
+
+        # Move sliding window
+        i = 1
+        j = k
+        while j < len(s):
+            if s[i - 1] in ["a", "e", "i", "o", "u"]:
+                curr -= 1
+                result = max(result, curr)
+            if s[j] in ["a", "e", "i", "o", "u"]:
+                curr += 1
+                result = max(result, curr)
+            i += 1
+            j += 1
+        return result

tests/test_1456_maximum_number_of_vowels_in_a_substring_of_given_length.py

@@ -0,0 +1,19 @@
+import pytest
+
+from awesome_python_leetcode._1456_maximum_number_of_vowels_in_a_substring_of_given_length import (  # noqa: E501
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "k", "expected"],
+    argvalues=[
+        ("abciiidef", 3, 3),
+        ("aeiou", 2, 2),
+        ("leetcode", 3, 2),
+    ],
+)
+def test_func(s: str, k: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    max_vowels = Solution().maxVowels(s, k)
+    assert max_vowels == expected