Given a string str, the task is to check whether all the substrings of length ≥ 2 have the number of vowels at least as that of the number of consonants.
Input: str = “acaba”
The substring “cab” has 2 consonants and a single vowel.
Input: str = “aabaa”
Approach: There are only two cases where the given condition is not satisfied:
- When there are two consecutive consonants as in this case a substring of size 2 can have 2 consonants and no vowels.
- When there is a vowel surrounded by two consonants, in this case a substring of length 3 is possible with 2 consonants and 1 vowels.
All the other cases will always satisfy the given conditions.
Below is the implementation of the above approach:
- Find the number of words of X vowels and Y consonants that can be formed from M vowels and N consonants
- Number of words that can be made using exactly P consonants and Q vowels from the given string
- Encrypt string with product of number of vowels and consonants in substring of size k
- Check if a string can be converted to another string by replacing vowels and consonants
- Count the number of vowels occurring in all the substrings of given string
- Replace all consonants with nearest vowels in a string
- Modify string by removing vowels in between two consonants
- Modify the string by swapping continuous vowels or consonants
- Count strings with consonants and vowels at alternate position
- Arrange consonants and vowels nodes in a linked list
- Substrings starting with vowel and ending with consonants and vice versa
- Count substrings that contain all vowels | SET 2
- Find substrings that contain all vowels
- Queries to find the count of vowels in the substrings of the given string
- Replace consonants with next immediate consonants alphabetically in a String
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.