Given two strings S1 and S2, you are allowed only to change a character at any position to any vowel if it is a vowel or to a consonant, if it is a consonant. The task is to check if a string S1 can be changed to S2 or S2 can be changed to S1.
Input: S1 = “abcgle”, S2 = “ezggli”
Change ‘a’ to ‘e’, ‘b’ to ‘z’, ‘c’ to ‘g’ and ‘e’ to ‘i’.
Input: S1 = “abc”, S2 = “cgth”
Approach: The following conditions should be followed to solve the above problem:
- The length of both the string should be equal.
- At every index, the character of S1 and S2 should be both vowel or consonant.
Below is the implementation of the above approach:
- 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
- Encrypt string with product of number of vowels and consonants in substring of size k
- Check if a String can be converted to Pangram in K changes
- Check whether the vowels in a string are in alphabetical order or not
- Replace consonants with next immediate consonants alphabetically in a String
- Count consonants in a string (Iterative and recursive methods)
- Count strings with consonants and vowels at alternate position
- First X vowels from a string
- Reverse vowels in a given string
- Modify the string such that it contains all vowels at least once
- Program to remove vowels from a String
- Remove consecutive vowels from string
- Count the pairs of vowels in the given 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.