Find the Maximum Number of Repetitions

Given an Array of integers, write a method that will return the integer with the maximum number of repetitions. Your code is expected to run with O(n) time complexity and O(1) space complexity. The elements in the array are between 0 to size(array) - 1 and the array will not be empty.

f({3,1,2,2,3,4,4,4}) --> 4

Need a hand? Try out these hints, one at a time.

Quick hint to get things rolling

Try and use the problem's constraints to your advantage. Numbers stored in the array are constrained by the length of the array.

Final hint! You should be able to code the problem on viewing this.

1. Iterate through the input array a. For every element a[i], increment a[a[i]%k] by k, where the array contains numbers in range of k-1.

2. Find the max value in the modified array. Index of the maximum element is the biggest repeating element

public static int getMaxRepetition(int[] a) {
    




    
}

This Coding Interview Question is available with an answer in the following programming languages :

Java

Python

Find the Maximum Number of Repetitions

Quick hint to get things rolling

Final hint! You should be able to code the problem on viewing this.

The interview prep tool you'll fall in love with!

This Coding Interview Question is available with an answer in the following programming languages :