Substring counter

CodeChefOpen on judge ↗

In this task you have to find the presence of vowels in all possible substrings of the given string and its reverse-string. For each given string you have to print the total number of vowels. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, contains a string, string contains both lower case and

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