Thursday, 6 April 2017

Geeksforgeeks Solution For " Longest Distinct characters in 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 :- Longest Distinct characters in string

Submit Your Solution :- Click Here 

Solution :- 

#include<iostream>
using namespace std;
#include<string.h>
int Longest_Distinct_characters_string(string ) ;
int main()
 {
 int t,ans ;
 string str ;
 cin>>t ;
 while(t--)
 {
     cin>>str ;
     ans=Longest_Distinct_characters_string(str) ;
    
     cout<<ans<<endl ;
 }
 return 0;
}

int Longest_Distinct_characters_string(string str)
{
    int l,i,j,count,max ;
    l=str.length() ;
    max=0 ;
   
    for(i=0;i<l;i++)
    {
        int hash[256]={0} ;
        count=0 ;
        for(j=i;j<l;j++)
        {
            if(hash[str[j]]==0)
            {
                hash[str[j]]++ ;
                count++ ;
            }
            else
                break ;
        }
        if(max<count)
            max=count ;
    }
    return max ;
}

Output:-



Geeksforgeeks Solution For " Longest Distinct characters in string "

No comments:
Write comments

Recommended Posts × +