← All problemsSign in

VALID WORDS

You are given a single string containing some words.The string contains numbers and letters in lowercase. A valid word is a word whose second letter is a vowel and first letter is not a digit.You have to find the lexicographically smallest string which consists of the first letters of all the valid words given. You can assume that all words have length greater than equal to two. There will be at

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

Sign in to chat with the tutor and save your progress.

Sign in to start