Given a word of length less than 10, the task is to find a number of ways in which it can be arranged without changing the relative position of vowel and consonants.
Input: "GEEKS" Output: 6 Input: "COMPUTER" Output: 720
- Count the vowels and consonants in the word
- Now find total number of ways to arrange vowel only
- Then find ways to arrange consonant only.
- Multiply both answer to get the Total ways = (no of ways to arrange vowel only)*(no of ways to arrange consonant only)
Below is the implementation of the above approach:
- Substrings starting with vowel and ending with consonants and vice versa
- Count strings with consonants and vowels at alternate position
- Replace consonants with next immediate consonants alphabetically in a String
- Check if the given string of words can be formed from words present in the dictionary
- Count words that appear exactly two times in an array of words
- Alternate vowel and consonant string
- Program to find if a character is vowel or Consonant
- Lexicographically first alternate vowel and consonant string
- Print the last occurrence of elements in array in relative order
- Print all Subsequences of String which Start with Vowel and End with Consonant.
- Python program to check if given string is vowel Palindrome
- Find the arrangement of queue at given time
- Arrangement of the characters of a word such that all vowels are at odd places
- Maximum height of triangular arrangement of array values
- Seating arrangement of n boys and girls alternatively around a round table
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.