K Vowels

CodeChefOpen on judge ↗

You are given a string S of length N and an integer K. The string contains alphabets, denoting different types of candies. The lower case and upper case alphabets denote same type of candies, i.e. A and a denote same type of candy. There are some special candies denoted by vowels. You want to eat all the candies but there are two restrictions. You have to pick continous candies, i.e. a substrin

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