Add solution for reverse vowels

Author: kwnna15

array/reverse-vowels/README.md

@@ -0,0 +1,32 @@
+# 605. Can Place Flowers
+
+## Description
+See https://leetcode.com/problems/can-place-flowers/description/
+
+## Problem
+You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
+
+Given an integer array `flowerbed` containing `0`'s and `1`'s, where `0` means empty and `1` means not empty, and an integer `n`, return `true` if `n` new flowers can be planted in the `flowerbed` without violating the no-adjacent-flowers rule and `false` otherwise.
+
+## Example 1
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 1
+Output: true
+```
+
+## Example 2
+
+```
+Input: flowerbed = [1,0,0,0,1], n = 2
+Output: false
+```
+
+## Constraints
+
+```
+1 <= flowerbed.length <= 2 * 104
+flowerbed[i] is 0 or 1.
+There are no two adjacent flowers in flowerbed.
+0 <= n <= flowerbed.length
+```

array/reverse-vowels/reversevowels.py

@@ -0,0 +1,15 @@
+def reverse_vowels(s: str) -> str:
+    s = list(s)
+    left = 0
+    right = len(s) - 1
+    vowels = set("AEIOUaeiou")
+    while left < right:
+        while left < right and s[left] not in vowels:
+            left += 1
+        while left < right and s[right] not in vowels:
+            right -= 1
+        s[left], s[right] = s[right], s[left]
+        left += 1
+        right -= 1
+    s = "".join(s)
+    return s

array/reverse-vowels/reversevowels_test.py

@@ -0,0 +1,21 @@
+from reversevowels import reverse_vowels
+
+def test_example_1():
+    s = "hello"
+    assert reverse_vowels(s) == "holle"
+
+def test_example_2():
+    s = "leetcode"
+    assert reverse_vowels(s) == "leotcede"
+
+def test_example_3():
+    s = "aA"
+    assert reverse_vowels(s) == "Aa"
+
+def test_example_4():
+    s = "aeiou"
+    assert reverse_vowels(s) == "uoiea"
+
+def test_example_5():
+    s = "bcdfg"
+    assert reverse_vowels(s) == "bcdfg"