Is there any other way of solving Problem-21?
Problem- 21 Given an array of n numbers. Give an algorithm for finding the element which appears maximum number of times in the array?
2. For Problem-21, can we improve the time complexity? Assume that the elements range is o to
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here