Easy 0 solved 0% acceptance

Word Scramble

Scramble words by swapping each vowel with the consonant right after it, scanning left to right.

What you'll learn

  • Walk through a string with a manual index
  • Swap two adjacent characters
  • Skip ahead after a swap

Problem

A word puzzle app makes easy scrambles with one rule. Scan each word from left to right. Whenever a vowel (a, e, i, o, u) is directly followed by a consonant (any other letter), swap the two letters and continue scanning after the pair, so a letter is never moved twice. Otherwise move on by one letter.

For example orange: o and r swap to give ro, then scanning continues at a, which swaps with n, then at g, which is not a vowel, and e is the last letter: ronage.

Implement word_scramble(words).

Input

words: The words, in lowercase letters.

Output

Return the scrambled words in the same order. A word with no vowel followed by a consonant comes back unchanged.

Constraints

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

Examples

Example 1
Input:
words = ["orange", "apple"]

Expected output:
expected = ["ronage", "paple"]
Input:
std::vector<std::string> words = {"orange", "apple"};

Expected output:
std::vector<std::string> expected = {"ronage", "paple"};
Input:
string[] words = new string[] {"orange", "apple"};

Expected output:
string[] expected = new string[] {"ronage", "paple"};

Explanation

orange becomes ronage as shown above. In apple, a swaps with p to give pa, then p, l and e stay: paple.

Example 2
Input:
words = ["sky", "tea", "eat"]

Expected output:
expected = ["sky", "tea", "eta"]
Input:
std::vector<std::string> words = {"sky", "tea", "eat"};

Expected output:
std::vector<std::string> expected = {"sky", "tea", "eta"};
Input:
string[] words = new string[] {"sky", "tea", "eat"};

Expected output:
string[] expected = new string[] {"sky", "tea", "eta"};

Explanation

sky has no vowels and tea has no vowel before a consonant, so both stay. In eat, e is followed by the vowel a, then a swaps with t: eta.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Work on a mutable copy of the word, like a character array.

Hint 2

After a swap, move the index forward by 2 so the moved letters are not looked at again.

Hint 3

Without a swap, move forward by 1.

Expected complexity

O(total letters) time, O(longest word) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.