purnendu_patra

 Profile Answers by purnendu_patra 

• Dec 11th, 2007

 

Th solution I can think of is of complexity O(n) by using an additional array of size 26.

Scan the entire array and increase the counter for the respective characters. After the scan is done we need another scan of those counters to find the maximum one and that will be the chanracter with maximum frequency. this will also take O(n) time.

I am eager to a get solution better than this..:-)

Vishwas.p

 Profile Answers by Vishwas.p 

• Feb 8th, 2008

 

#include <string.h>
#include <unistd.h>
#include <stdio.h>
#include<stdlib.h>
main()
{
int i=0,l,big,ascii,counter[300],value;
char s[100];
for(i=0;i<300;i++) counter[i]=0;
printf("nEnter the string : ");
scanf("%s",&s);
printf("String = %s",s);
l=strlen(s);
printf("nlength = %dnn",l);
for(i=0;i<l;i++)
  {
    ascii = s[i];
    final = ascii;
    counter[ascii]++;
  }
big = counter[0]; 
for(i=0;i<300;i++)
 {
   if (counter[i]>big)
    {
    big = counter[i];
    value = i;
    }
 }   
 
 printf(" %c is max repeated letter for %d timesn",value,big);
 
 }
 
 
 
 

contact.nidhigupta

 Profile Answers by contact.nidhigupta 

• Feb 19th, 2008

 

Key points are:
1) Max number of characters can only be 256.
2) There is need to specify only the character repeating max no. of times.

so i think one simple solution can be:
 

#include <stdio.h>

#include<stdlib.h>

#define MAXNUMCHAR 256
void main()

{

int i=0;

char s[100];

char ascii = 0;

int counter[MAXNUMCHAR] = {0};

char max = 0;

int maxNum = 0;printf(

"nEnter the string : ");

gets(s);

printf("String = %sn",s);for(i=0; s[i] != ''; i++)

{

ascii = s[i];

counter[ascii]++;

if (counter[ascii] > max) {

max = counter[ascii];

maxNum = ascii;

}

}

printf(" %c is max repeated letter for %d timesn", maxNum, max);

_getch();

}

Ashish.Shekhar

 Profile Answers by Ashish.Shekhar 

• Feb 23rd, 2008

 

I have an opinion that a hash table with indexing based on the ascii values of the characters would bring the complexity down further and would add some time benefits as well.

pvsola

 Profile Answers by pvsola 

• Apr 3rd, 2008

 

There is an way to solve this issue with complexity of O(n).

1.  MAke an array size of 256

2.  Using each charater read from the string as an index incremented the counter of corresponding character.

3.  Let that counter be max, so inshort you have variables holding a char with number of times repeated in the string.

4.  Repeat the proceess for all the characters and compare it with current max counter, if maximum change it

There might be posibility of more than one charater haivng same max counter, problem don't ask for such situation, any way for an interview keep it precise guys!!

vinod148

 Profile Answers by vinod148 

• Oct 23rd, 2009

 

There is no way for less that O(n) solution as we have to traverse the string atleast once.

By traversing only once we can find the solution

Keep another variable which tracks the current highest occured character.