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:
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Modify string by removing vowels in between two consonants
- Replace all consonants with nearest vowels in a string
- 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 one string can be converted to another
- Check if a String can be converted to Pangram in K changes
- Check whether all the substrings have number of vowels atleast as that of consonants
- Check whether the vowels in a string are in alphabetical order or not
- Replace consonants with next immediate consonants alphabetically in a String
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Longest Subsequence of a String containing only Consonants
- Find the resultant String after replacing X with Y and removing Z
- Count consonants in a string (Iterative and recursive methods)
- Count strings with consonants and vowels at alternate position
- Make the string lexicographically smallest and non palindromic by replacing exactly one character
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.