[Solution] Easy Pronunciation CodeChef Solution

Words that contain many consecutive consonants, like "schtschurowskia", are generally considered somewhat hard to pronounce.

We say that a word is hard to pronounce if it contains 4$4$ or more consonants in a row; otherwise it is easy to pronounce. For example, "apple" and "polish" are easy to pronounce, but "schtschurowskia" is hard to pronounce.

You are given a string S$S$ consisting of N$N$ lowercase Latin characters. Determine whether it is easy to pronounce or not based on the rule above — print YES if it is easy to pronounce and NO otherwise.

For the purposes of this problem, the vowels are the characters {a,e,i,o,u}$\{a,e,i,o,u\}$ and the consonants are the

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

other 21$21$ characters.

Input Format

• The first line of input will contain a single integer T$T$, denoting the number of test cases.

True and False Paper CodeChef Solution

The Last Levels CodeChef Solution

Easy Pronunciation CodeChef Solution

Yet Another Palindrome Making Problem CodeChef Solution

Largest Family Codechef Solution

Maximum Median Matching CodeChef Solution

Consecutive XOR Codechef Solution

Interior Design Codechef Solution

• Each test case consists of two lines of input.
  • The first line of each test case contains a single integer N$N$, the length of string S$S$.
  • The second line of each test case contains the string S$S$.

Output Format

For each test case, output on a new line the answer — YES if S$S$ is easy to pronounce, and NO otherwise.

Each character of the output may be printed in either uppercase or lowercase. For example, the strings YES, yeS, yes, and YeS will all be treated as identical.

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤N≤100$1\le N\le 100$
• S$S$ contains only lowercase Latin characters, i.e, the characters {a,b,c,…,z}