Total Strings (keteki)

CodeChefOpen on judge ↗

Given a string which always has alternating vowels and consonants, always starting with a consonant. Some of the characters in the string are "*" (quotes for clarity). Find the total number of strings that can be formed by replacing the "*" with characters. Characters should be placed in such a way that it always is alternating in vowels in consonants, and always starting with a consonant. Po

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