Leetcode - Reverse Vowels of a String Solution
1 min read

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)

Enjoying these posts? Subscribe for more


Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add thepoorcoder.com to your ad blocking whitelist or disable your adblocking software.

×