CareerCup

counting sort

We can use hash technique. This works for ASCII characters. There are 256 of them. So intitialize an int arr of 5 to 255 to 0. Hash the characters based on their ASCII values. Keep incrementing the counts in the array. Hash them again to find the max character count.

Correction: So intitialize an int arr of 0 to 255 to 0.

can u list the testcases which you mentioned ?

Using a hash technique..

int maxcount(string str){
	map<char,int> matches;
	if(str.size()<=0)
		return 0;
	int max=1;
	for(int i=0;i<str.size();++i){
		if(matches.find(str[i]) == matches.end()){
			matches.insert(pair<char,int>(str[i],1));
		}
		else 
		{
			matches.find(str[i])->second++;
			if(max<matches.find(str[i])->second)
				max=matches.find(str[i])->second;
		}
	}
	return max;
}

Test cases which actually recovered bugs for me
Input- output
aabbaac - 4
abcabc - 2
-0//null string
a- 1
123ab2- 2
^^^cd12- 3
Aabbb- 3

suffix tree

binary search tree.

use inorder traversal to sort

int hash(char c){
  return c - 65;
}

int retMaxCount(char *str){

    int hashmap[255] = { 0 };
    int i = 0;
    while ( *(str + i) != '\0' ){
       hashmap[hash(str+i)]++; 
    }
    
    int n = -1;
    while ( i < 255 ){
      if ( n < hashmap[i]) {
          n = hashmap[i]; 
       }
     }
   return n;
}