reverse-words-with-same-vowel-count

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>s</code> consisting of lowercase English words, each separated by a single space.

Determine how many vowels appear in the first word. Then, reverse each following word that has the same vowel count. Leave all remaining words unchanged.

Return the resulting string.

Vowels are <code>&#39;a&#39;</code>, <code>&#39;e&#39;</code>, <code>&#39;i&#39;</code>, <code>&#39;o&#39;</code>, and <code>&#39;u&#39;</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;cat and mice&quot;

Output: &quot;cat dna mice&quot;

Explanation:​​​​​​​

<ul>
	<li>The first word <code>&quot;cat&quot;</code> has 1 vowel.</li>
	<li><code>&quot;and&quot;</code> has 1 vowel, so it is reversed to form <code>&quot;dna&quot;</code>.</li>
	<li><code>&quot;mice&quot;</code> has 2 vowels, so it remains unchanged.</li>
	<li>Thus, the resulting string is <code>&quot;cat dna mice&quot;</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;book is nice&quot;

Output: &quot;book is ecin&quot;

Explanation:

<ul>
	<li>The first word <code>&quot;book&quot;</code> has 2 vowels.</li>
	<li><code>&quot;is&quot;</code> has 1 vowel, so it remains unchanged.</li>
	<li><code>&quot;nice&quot;</code> has 2 vowels, so it is reversed to form <code>&quot;ecin&quot;</code>.</li>
	<li>Thus, the resulting string is <code>&quot;book is ecin&quot;</code>.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: s = &quot;banana healthy&quot;

Output: &quot;banana healthy&quot;

Explanation:

<ul>
	<li>The first word <code>&quot;banana&quot;</code> has 3 vowels.</li>
	<li><code>&quot;healthy&quot;</code> has 2 vowels, so it remains unchanged.</li>
	<li>Thus, the resulting string is <code>&quot;banana healthy&quot;</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> consists of lowercase English letters and spaces.</li>
	<li>Words in <code>s</code> are separated by a single space.</li>
	<li><code>s</code> does not contain leading or trailing spaces.</li>
</ul>

Weekly Contest 480

weekly-contest-480

reverseWords

Senior

Reverse Words With Same Vowel Count

Two Pointers

String

Simulation

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given a string s consisting of lowercase English words, each separated by a single space.

Determine how many vowels appear in the first word. Then, reverse each following word that has the same vowel count. Leave all remaining words unchanged.

Return the resulting string.

Vowels are 'a', 'e', 'i', 'o', and 'u'.

 

Example 1:

Input: s = "cat and mice"

Output: "cat dna mice"

Explanation:

 * The first word "cat" has 1 vowel.
 * "and" has 1 vowel, so it is reversed to form "dna".
 * "mice" has 2 vowels, so it remains unchanged.
 * Thus, the resulting string is "cat dna mice".

Example 2:

Input: s = "book is nice"

Output: "book is ecin"

Explanation:

 * The first word "book" has 2 vowels.
 * "is" has 1 vowel, so it remains unchanged.
 * "nice" has 2 vowels, so it is reversed to form "ecin".
 * Thus, the resulting string is "book is ecin".

Example 3:

Input: s = "banana healthy"

Output: "banana healthy"

Explanation:

 * The first word "banana" has 3 vowels.
 * "healthy" has 2 vowels, so it remains unchanged.
 * Thus, the resulting string is "banana healthy".

 

Constraints:

 * 1 <= s.length <= 105
 * s consists of lowercase English letters and spaces.
 * Words in s are separated by a single space.
 * s does not contain leading or trailing spaces.