Count the vowel subsets

CodeChefOpen on judge ↗

Count all such subsets in a string such that each subset contains only vowels and each vowel comes atleast once. ###Input: - Single line contains string input ###Output: - Single line contains integer output ###Constraints - $1 \leq length of string \leq 1000$ ###Sample Input: Heiuoatyytyoou ###Sample Output: 1

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