CodingEasycod-g1415

Subject Two pointersLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.