World of Strings

CodeChefOpen on judge ↗

Abhi is trapped in the world of Strings and can see $T$ strings around him consisting of lowercase alphabets. In order to escape, he has to calculate length of longest substring such that all its characters are vowels and no two adjacent alphabets are same. ###Input - First line contains $T$ , number of test cases. - Second line contains $N$ , the size of the string. - Third line con

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