Thursday, 6 April 2017

Geeksforgeeks Solution For " Good String "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- A good string is one where the distance between every two adjacent character is exactly 1 For More Detail Click Here

Submit Your Solution :- Click Here 

Solution :- 

#include<bits/stdc++.h>
using namespace std;

string Good_String(string );

int main()
 {
 int t ;
 string str ;
 cin>>t ;
 while(t--)
 {
    cin>>str ;
    str=Good_String(str) ;
    cout<<str<<endl ;
 }
 return 0;
}

string Good_String(string str)
{
    int l ;
    l=str.length() ;
   
    int i ;
    for(i=0;i<l-1;i++)
    {
        if((abs(str[i]-str[i+1])!=25)&&(abs(str[i]-str[i+1])!=1))
            return "NO" ;
    }
    return "YES" ;
}   

Output:-

Geeksforgeeks Solution For " Good String "



No comments:
Write comments

Recommended Posts × +