आसान 0 हल किए गए 0% स्वीकृति

Word Scramble

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

आप क्या सीखेंगे

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

समस्या

अनुवाद दिखाएँ

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.

सीमाएँ

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

उदाहरण

उदाहरण 1
इनपुट:
words = ["orange", "apple"]

अपेक्षित आउटपुट:
expected = ["ronage", "paple"]
इनपुट:
std::vector<std::string> words = {"orange", "apple"};

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"ronage", "paple"};
इनपुट:
string[] words = new string[] {"orange", "apple"};

अपेक्षित आउटपुट:
string[] expected = new string[] {"ronage", "paple"};

व्याख्या

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

उदाहरण 2
इनपुट:
words = ["sky", "tea", "eat"]

अपेक्षित आउटपुट:
expected = ["sky", "tea", "eta"]
इनपुट:
std::vector<std::string> words = {"sky", "tea", "eat"};

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"sky", "tea", "eta"};
इनपुट:
string[] words = new string[] {"sky", "tea", "eat"};

अपेक्षित आउटपुट:
string[] expected = new string[] {"sky", "tea", "eta"};

व्याख्या

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.

कैसे हल करें

पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।

संकेत 1

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

संकेत 2

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

संकेत 3

Without a swap, move forward by 1.

अपेक्षित जटिलता

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

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

हर कोडर का सबसे अच्छा पास हुआ समाधान। तेज़, कम मेमोरी वाले और बेहतर रेटिंग वाले समाधान ऊपर रहते हैं।

अभी कोई पास हुआ समाधान नहीं है। इसे हल करें और पहला स्थान पाएँ।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।