D. J.:

- Added the leetcode problem and solution for 2785

Author: nobodyPerfecZ

README.md

@@ -294,6 +294,7 @@
 - [2390 Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/description/)
 - [2466 Count Ways To Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings/description/)
 - [2523 Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range/description/)
+- [2785 Sort Vowels in a String](https://leetcode.com/problems/sort-vowels-in-a-string/description/)
 - [2799 Count Complete Subarrays in an Array](https://leetcode.com/problems/count-complete-subarrays-in-an-array/description/)
 - [3136 Valid Word](https://leetcode.com/problems/valid-word/description/)
 - [3202 Find the Maximum Length of Valid Subsequence II](https://leetcode.com/problems/find-the-maximum-length-of-valid-subsequence-ii/description/)

awesome_python_leetcode/_2785_sort_vowels_in_a_string.py

@@ -0,0 +1,34 @@
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def sortVowels(self, s: str) -> str:
+        """
+        Given a 0-indexed string s, permute s to get a new string t such that:
+        - All consonants remain in their original places. More formally, if there is an
+        index i with 0 <= i < s.length such that s[i] is a consonant, then t[i] = s[i].
+        - The vowels must be sorted in the nondecreasing order of their ASCII values.
+        More formally, for pairs of indices i, j with 0 <= i < j < s.length such that
+        s[i] and s[j] are vowels, then t[i] must not have a higher ASCII value than
+        t[j].
+
+        Return the resulting string.
+
+        The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in lowercase or
+        uppercase. Consonants comprise all letters that are not vowels.
+        """
+        # Get the vowels and position of them
+        vowels = [c for c in s if c in "aeiouAEIOU"]
+
+        # Sort the vowels
+        vowels.sort()
+
+        # Return the resulting string with sorted vowels
+        result = []
+        j = 0
+        for c in s:
+            if c in "aeiouAEIOU":
+                result.append(vowels[j])
+                j += 1
+            else:
+                result.append(c)
+        return "".join(result)

tests/test_2785_sort_vowels_in_a_string.py

@@ -0,0 +1,16 @@
+import pytest
+
+from awesome_python_leetcode._2785_sort_vowels_in_a_string import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["s", "expected"],
+    argvalues=[
+        ("lEetcOde", "lEOtcede"),
+        ("lYmpH", "lYmpH"),
+    ],
+)
+def test_func(s: str, expected: str):
+    """Tests the solution of a LeetCode problem."""
+    sorted_s = Solution().sortVowels(s)
+    assert sorted_s == expected