Closest Vowels

CodeChefRating 1241Open on judge ↗

Chef considers a string consisting of lowercase English alphabets *beautiful* if **all** the characters of the string are **vowels**. Chef has a string $S$ consisting of lowercase English alphabets, of length $N$. He wants to convert $S$ into a *beautiful* string $T$. In order to do so, Chef does the following operation on **every** character of the string: - If the character is a **consonant**,

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI