Leetcode - Reverse Vowels of a String Solution

Given a string s, reverse only all the vowels in the string and return it.

The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both cases.

Example 1:

Input: s = "hello"
Output: "holle"

Example 2:

Input: s = "leetcode"
Output: "leotcede"

Constraints:

  • 1 <= s.length <= 3 * 105
  • s consist of printable ASCII characters.

Solution in python

class Solution:
    def reverseVowels(self, s: str) -> str:
        s = list(s)
        vowels = []
        indices = []
        for index, char in enumerate(s):
            if char.lower() in {"a", "e", "i", "o", "u"}:
                indices.append(index)
                vowels.append(char)
        for index,char in zip(reversed(indices),vowels):
            s[index] = char
        return "".join(s)

Subscribe to The Poor Coder | Algorithm Solutions

Don’t miss out on the latest issues. Sign up now to get access to the library of members-only issues.
[email protected]
Subscribe