[Solution] Closest Vowels CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Closest Vowels CodeChef Solution | CodeChef Problem Solution 2022

Chef considers a string consisting of lowercase English alphabets beautiful if all the characters of the string are vowels.

Chef has a string S$S$ consisting of lowercase English alphabets, of length N$N$. He wants to convert S$S$ into a beautiful string T$T$. In order to do so, Chef does the following operation on every character of the string:

• If the character is a consonant, change the character to its closest vowel.
• If the character is a vowel, don't change it.

Solution Click Below:-  CLICK HERE

Chef realizes that the final string T$T$ is not unique. Chef wonders, what is the total number of distinct beautiful strings T$T$ that can be obtained by performing the given operations on the string S$S$.

Since the answer can be huge, print it modulo 109+7${10}^9+7$.

Note:

My very 1st contest! CodeChef Solution

Chess Ratings CodeChef Solution

[Solution] Recent contest problems CodeChef Solution

A or B CodeChef Solution

Closest Vowels CodeChef Solution

Minimize Blocked Roads CodeChef Solution

• There are 26$26$ characters in the English alphabet. Five of these characters are vowels: a, e, i, o, and u. The remaining 21$21$ characters are consonants.
• The closest vowel to a consonant is the vowel that is least distant from that consonant. For example, the distance between the characters d and e is 1$1$ while the distance between the characters d and a is 3$3$.
• The distance between the characters z and a is 25$25$ and not 1$1$.

Input Format

• The first line of input will contain an integer T$T$ — the number of test cases. The description of T$T$ test cases follows.
• The first line of each test case contains an integer N$N$, denoting the length of the string S$S$.
• The second line of each test case contains a string S$S$ consisting of lowercase English alphabets.

Output Format

For each test case, output the total number of distinct beautiful strings T$T$ that can be obtained by performing the given operations on the string S$S$, modulo 109+7${10}^9+7$.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤N≤105$1\le N\le {10}^5$
• Sum of N$N$ over all test cases does not exceed 105${10}^5$.