Chef and Happy String

CodeChefRating 956Open on judge ↗

Chef has a string $S$ with him. Chef is happy if the string contains a **contiguous substring** of length **strictly greater** than $2$ in which all its characters are vowels. Determine whether Chef is happy or not. Note that, in english alphabet, vowels are `a`, `e`, `i`, `o`, and `u`. ### Input - First line will contain $T$, number of test cases. Then the test cases follow. - Each test case

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