Code RoomReverse vowels only
EasyPrep Room Coding #611

Reverse vowels only

CodingAlgorithms & data structuresEntry–Mid~12 min

Given a lowercase string s, reverse the order of its vowels (a, e, i, o, u) while every other character stays exactly where it is, and return the resulting string. Use one pointer scanning from each end: skip non-vowels, swap when both pointers rest on vowels. Example: 'hello' becomes 'holle', and 'audio' becomes 'oidua'.

Implement
reverse_vowels(s: str) → str
Examples
in["hello"]out"holle"
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 12 min
InputExpectedGot
["hello"]"holle"not run yetsample