fork download 
  1. #include <iostream>
  2. #include<stdio.h>
  3. #include<memory.h>
  4. #include<limits.h>
  5. #include<string.h>
  6. using namespace std;
  7.  
  8. char str[100005];
  9. int hashmap[300];
  10. int main() 
  11. {
  12. 	int t,n,i,j,maxlen,prev_index,cur_len;
  13. 	scanf("%d",&t);
  14. 	while(t--)
  15. 	{
  16. 		memset(hashmap,-1,sizeof(hashmap));
  17. 		scanf("%s",str);
  18. 		maxlen=1;
  19. 		cur_len=1;
  20. 		hashmap[str[0]]=0;
  21. 		n=strlen(str);
  22. 		for(i=1;i<n;i++)
  23. 		{
  24. 			prev_index=hashmap[str[i]];
  25.  
  26. 			if(prev_index==-1||i-cur_len>prev_index)
  27. 			{
  28. 				cur_len++;
  29. 			}
  30. 			else
  31. 			{
  32. 				if(maxlen<cur_len)
  33. 				maxlen=cur_len;
  34.  
  35. 				cur_len=i-prev_index;
  36. 			}
  37. 			hashmap[str[i]]=i;
  38. 		}
  39. 		if(cur_len>maxlen)
  40. 		maxlen=cur_len;
  41.  
  42. 		printf("%d\n",maxlen);
  43. 	}
  44. 	// your code goes here
  45. 	return 0;
  46. }
Success #stdin #stdout 0.01s 5284KB
comments (?)
stdin 
10
aba
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
stdout 
2
7
7
7
7
7
7
7
7
7
https://ideone.com/aTyw3P
#include<stdio.h>
void main()
{
printf("Frequency of each element of an array\nA.Mohammed Irfaan\n");
int n, ary[n], i, c, m;
printf("Enter how many number to print:\n");
scanf("%d", &n);
for(i=0; i<n; i++)
{
printf("Enter the number %d:\n", i+1);
scanf("%d", &ary[i]);
}
m=0;
c=0;
for(m=0; m<n; m++)
{
for(i=n-1; i>=m; i--)
{
if(ary[m]==ary[i])
{
c=c+1;
}
}
for(i=0; i<m; i++)
{
if(ary[m]==ary[i])
{
c=c+1;
}
}
printf("The frequency of element %d =%d\n", m+1, c);
c=0;
}
}
language:
C++ (gcc 8.3)
created:
5 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!