Friend-zoned Parhi

CodeChefOpen on judge ↗

Parhi's Girlfriend loves words which contains vowels only. They play a game where Parhi would get a string from her and he needs to find out the length of the longest sub-string containing vowels only. If he fails, then his girlfriend would friend-zone him. Help Parhi to impress his girlfriend and not get friend-zoned! . Input: First line contains an integer T denoting the number of test cases.

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