CV

CodeChefOpen on judge ↗

Chef has a string $S$ with length $N$. He needs to find the number of indices $i$ ($1 \le i \le N-1$) such that the $i$-th character of this string is a consonant and the $i+1$-th character is a vowel. However, he is busy, so he asks for your help. Note: The letters 'a', 'e', 'i', 'o', 'u' are vowels; all other lowercase English letters are consonants. ### Input - The first line of the inpu

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