Language Research
You are a language researcher working on a unique project that involves studying the usage of vowels in different languages. Part of your study involves identifying words that contain at least three consecutive vowels.
You are given a single line of text and your task is to write a program that finds all the words in the string that have at least three consecutive vowels.
The output of the program should contain all the words that have at least three consecutive vowels, each on a new line. If there are no such words in the sentence, the program should output
No Words Found.Input | Output |
The curious dog is named Beau. | curious
Beau |
What a beautiful day! I can’t believe it! | beautiful |
No such word here. | No Words Found |
Note: The consecutive vowels can be any of the following:
a, e, i, o, u. The output words should be in the order of appearance in the input.Constraints
Time limit: 0.2 seconds
Memory limit: 512 MB
Output limit: 1 MB