CareerCup

any constraint given... like o(n) Time complexity and o(1) or o(n) space complexity

A = given array.
Ab = ASCII of A % no need to initialize
Initialize B with size max(Ab)
Go thru Ab one by one, get the number 'n' and add 1 to the nth index B.
Finally get the max(B).

Time:2*o(n)
Space:2*o(n)

if no contraints on space then use a hashmap with alphabets as key and count as value. After traversing the array just return the largest count.
There are better solutions like some mentioned above.

if no contraints on space then use a hashmap with alphabets as key and count as value. After traversing the array just return the largest count.
There are better solutions like some mentioned above.

if no contraints on space then use a hashmap with alphabets as key and count as value. After traversing the array just return the largest count.
There are better solutions like some mentioned above.

I was expected to give a time and space efficient solution. There weren't any constraints given.
Using O(n) extra space is one option. That would be O(n) time.
You can sort the array in O(nlogn) time and get the result with one traversal and O(1) space.
I can't think of any better solution.

1) Use an array of size = No. of alphabets in language = 26 (English)
2) Traverse the character array and increment the corresponding index. ---> O(n)
3) Find index of largest value and print corresponding alphabet ---> O(n)

My solution
1. Use HashMap<alphabet, count> and find the alphabet with maximum count.
2. Quick Sort the alphabets in O(nlogn) and find the maximum in one traversal.

Take a array of size 26 ,each representing one alphabet.

Initilize all array elements by zero.

Scan array and increase count in the corresponding index.

you are done now.

//Voting algorithm
List<int> li16 = new List<int>();
li16.Add(1);
li16.Add(2);
li16.Add(2);
li16.Add(2);
li16.Add(1);
li16.Add(1);
li16.Add(2);
li16.Add(3);
li16.Add(2);
li16.Add(3);
int candidate16 = li16[0];
int count16 = 1;
for (int i = 1; i < li16.Count; i++)
{
if (li16[i] == candidate16)
count16++;
else count16--;
if (count16 == 0)
{
candidate16 = li16[i];
count16++;
}
}

char a[5]={'a','a','a','b','e'};
int num=0;
int hash[256]={0,};
for(int i=0;i<5;i++)
hash[a[i]]++;
int big=hash[0];

for(int i=1;i<256;i++)
{
if(hash[i]>big)
{
big=hash[i];
num=i;
}


}
cout<<endl<<big<<endl<<(char)num;

This is the perfect code which i have tested....