Nobel Vowel

dinesh450 · February 13, 2020, 11:49pm

Noble Vowel

Given a string SS your task is to find out whether a string is Noble Vowel string or not. A Nobel Vowel string is one in which there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant nn; after this letter, there can be any letter (not only a vowel) or there can be no letter at all.

Input format

The first line contains an integer T denoting the number of test cases. Each test case consists of one string S consisting of lower case alphabets.

Output format

For each test case on a new line print YES if S is a Noble Vowel string else print NO .

Constraints:

1<=T<=10
1<=|S|<=1000

Time Limit

1 second

Example

Input

2
aeiou
cefduo

Output

YES
NO

Explanation

In the first string, every vowel is followed by another vowel or consonant. So the string is Noble Vowel. In the second string, ff is a consonant, which should be followed by a vowel but it is being followed by another consonant, so this string is not Noble Vowel.

hexane · February 14, 2020, 4:16am

Start from index 0 and check the current character. If the current character is not vowel(i.e. consonant) then immediately check the next character. If the next character is also a consonant then the string is not Nobel Vowel.
Here the code :-
#include <bits/stdc++.h>
using namespace std;

#define TT ll tt; cin>>tt; while(tt--)

typedef long long ll;
typedef long double ld;

bool isVowel(char x) {
    if(x=='a' || x=='e' || x=='i' || x=='o' || x=='u')
        return true;
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    TT
    {
        string s;
        cin>>s;
        bool flag = true;
        for(int i=0;i<s.size()-1; i++) {
            if(!isVowel(s[i])) {
                if(!isVowel(s[i+1]) && s[i+1] != 'n') {
                    flag = false;
                    break;
                }
            }
        }
        if(flag)
            cout<<"YES\n";
        else
            cout<<"NO\n";
    }
    return 0;
}

anon70990627 · February 14, 2020, 5:01am

Question link!

dinesh450 · February 15, 2020, 12:04am

dinesh450 · February 15, 2020, 12:14am

you missed a condition that there is a exception ‘n’

hexane · February 15, 2020, 12:36pm

Corrected.

dinesh450 · February 15, 2020, 1:38pm

it is not accepting!!

hexane · February 16, 2020, 1:32pm

Provide Question Link.

vgopinath1 · April 27, 2020, 4:29pm

can any one solve this

Noble Vowel

Given a string SS your task is to find out whether a string is Noble Vowel string or not. A Nobel Vowel string is one in which there has to be a vowel after every consonant, but there can be any letter after any vowel. The only exception is a consonant nn; after this letter, there can be any letter (not only a vowel) or there can be no letter at all.

Input format

The first line contains an integer TT denoting the number of test cases. Each test case consists of one string SS consisting of lower case alphabets.

Output format

For each test case on a new line print YES if SS is a Noble Vowel string else print NO .

Constraints:

1<=T<=101<=T<=10 1<=|S|<=10001<=|S|<=1000

Time Limit

11 secon

Example

Input

2 aeiou cefduo

Output

YES NO

Explanation

In the first string, every vowel is followed by another vowel or consonant. So the string is Noble Vowel. In the second string, ff is a consonant, which should be followed by a vowel but it is being followed by another consonant, so this string is not Noble Vowel.

deepakstark47 · May 30, 2020, 12:16pm

import java.util.;
import java.io.;
public class Main {
public static void main(String args[]) throws IOException {
//write your code here
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
while(T!=0){
int flag=0;
int i;
String s=sc.next();
String str=s.toLowerCase();
char c[]=str.toCharArray();
for(i=0;i<str.length()-1;i++)
{
if(c[i]!=‘a’&&c[i]!=‘e’&&c[i]!=‘i’&&c[i]!=‘o’&&c[i]!=‘u’&&c[i]!=‘n’){
if(c[i+1]!=‘a’&&c[i+1]!=‘e’&&c[i+1]!=‘i’&&c[i+1]!=‘o’&&c[i+1]!=‘u’){
flag=1;
break;
}
}

    } 
    if(i==str.length()-1 && (c[i]=='a'||c[i]=='e'||c[i]=='i'||c[i]=='o'||c[i]=='u'||c[i]=='n'))
      flag=0;
    else{
      flag=1;
    }  
    
    if(flag==0){
      System.out.println("YES");
    }
    else if(flag==1){
    System.out.println("NO");
    }T--;
  }
}

}

hello_world_25 · June 11, 2020, 5:04pm

if(c[i]!=‘a’&&c[i]!=‘e’&&c[i]!=‘i’&&c[i]!=‘o’&&c[i]!=‘u’&&c[i]!=‘n’){ In these line why you write c[i]!=‘n’.Here n is not a vowel

mayu_12345666 · July 15, 2020, 4:12pm

it cannot correct for all test cases but my code is run for test case // program to check the noble vowel string
// program to check the noble vowel string
#include
#include
using namespace std;

int isvowel(char ch);//check the chrater is vowel or not

//driver function
int main()
{
int check=0,t;
cin>>t;

while(t--){
check=0;
string data;
cin>>data;
int i=0;
while(i!=data.length())// to check the complete string
{

 if(check==0)//contion when next can be anything
    {
        if(isalpha(data[i]))
            {
                if(isvowel(data[i]))
                    check=0;
                else
                {
                    if(data[i]=='n')
                        check=0;
                    else
                    check=1;
                }
            }
        else
            check=-1;
    }
 else if(check==1)
    {
        if(isvowel(data[i]))
        check=0;
        else
        check=-1;
  
    }
 else if(check==-1)//-1 indicate the string break the rules
        break;
i++;
}
if(check==0)
    cout<<"YES"<<endl;
else
    cout<<"NO"<<endl;
}

return 0;

}
int isvowel(char ch)
{
ch=tolower(ch);
if(ch==‘a’||ch==‘e’||ch==‘i’||ch==‘o’||ch==‘u’)
return 1;
else
return 0;
}

ninjahatori708 · October 19, 2020, 7:03pm

Hi @deepakstark47, I have a doubt, why there is a condition that the last character has to be a vowel and n? what is the problem if the last character is a consonant?
I am talking abt this :
if(i==str.length()-1 && (c[i]==‘a’||c[i]==‘e’||c[i]==‘i’||c[i]==‘o’||c[i]==‘u’||c[i]==‘n’))
flag=0;
else{
flag=1;

abhi_8778 · July 13, 2021, 5:19am

import java.util.;
import java.io.;

public class Main {
public static void main(String args[]) throws IOException {
BufferedReader br=new
BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(br.readLine());
while(t–>0)
{
String b=br.readLine();
String s=b.toLowerCase();
boolean flag=false;
int len=s.length();

    if(s.charAt(len-1)=='a'||s.charAt(len-1)=='e'
  ||s.charAt(len-1)=='i'||s.charAt(len-1)=='o'||
  s.charAt(len-1)=='u'||s.charAt(len-1)=='n')
  {
    flag=true;
  }
 if(flag)
 {
    for(int i=0;i<len-1;i++)
    {
      if(s.charAt(i)=='a'||s.charAt(i)=='e'
  ||s.charAt(i)=='i'||s.charAt(i)=='o'||
  s.charAt(i)=='u'||s.charAt(i)=='n')
  {
    continue;
  }
  else 
  {
    if(s.charAt(i+1)=='a'||s.charAt(i+1)=='e'
  ||s.charAt(i+1)=='i'||s.charAt(i+1)=='o'||
  s.charAt(i+1)=='u')
  {
    continue;
  }
  else
  {
    flag=false;
    break;
  }
  
  }
    }
 }
  if(flag)
  System.out.println("YES");
  else
  System.out.println("NO");
}
}

}

samothecook · July 29, 2021, 11:28am

in JAVA it worked. The extra condition is we have to check for the last character as vowel or ‘n’.
import java.util.;
import java.io.;
public class Main {
public static void main(String args[]) throws IOException {
Scanner sc=new Scanner(System.in);
int T=sc.nextInt();
while(T!=0){
int flag=0;
int i;
String s=sc.next();
String str=s.toLowerCase();
char c[]=str.toCharArray();
for(i=0;i<str.length()-1;i++)
{
if(c[i]!=‘a’&&c[i]!=‘e’&&c[i]!=‘i’&&c[i]!=‘o’&&c[i]!=‘u’&&c[i]!=‘n’){
if(c[i+1]!=‘a’&&c[i+1]!=‘e’&&c[i+1]!=‘i’&&c[i+1]!=‘o’&&c[i+1]!=‘u’){
flag=1;
break;
}
}
}
if(i==str.length()-1 && (c[i]==‘a’||c[i]==‘e’||c[i]==‘i’||c[i]==‘o’||c[i]==‘u’||c[i]==‘n’))
flag=0;
else{
flag=1;
}

if(flag==0){
  System.out.println("YES");
}
else if(flag==1){
System.out.println("NO");
}T--;

}
}
}

kshaggs · August 11, 2021, 6:33am

Can you send the corrected code. thanks

harshcodes21 · June 28, 2022, 2:54pm

THANK YOU BRO, YOUR CODE WORKED.

ssparsh68 · February 16, 2023, 9:38am

import java.util.;
import java.io.;

public class Main {
public static void main(String args[]) throws IOException {

  //write your code here
  Scanner sc=new Scanner(System.in);
  int t=sc.nextInt();
  sc.nextLine();         //****most important line to input string after inputting int
  String s="";
  char ch,ch1;
  
  while(t>0){
    s=sc.nextLine();
    int avoid=4,flag=0;   //very complicated
    char lc = s.charAt(s.length()-1);
    if(lc!='a' && lc!='e' && lc!='i' && lc!='o' && lc!='u' && lc!='n'){
    
      System.out.println("NO");
      avoid=5;
      
    } 
    else{
    
    for(int i=0; i<s.length()-1; i++){
      
      
      ch=s.charAt(i);
      ch1=s.charAt(i+1);
      // if(ch==' ')
      //   continue;
       
      if(ch!='a' && ch!='e' && ch!='i' && ch!='o' && ch!='u' && ch!='n'){
        if(ch1!='a' && ch1!='e' && ch1!='i' && ch1!='o' && ch1!='u'){
          flag++;
          System.out.println("NO");
          break;
        }
      }
      // if(i==s.length()-2);
      //   break;
    }
    if(flag==0 && avoid==4)
      System.out.println("YES");
    }
    
    t--;
  }
}

}