human
Find the maximum repeating number in O ( n ) time and O ( 1 ) extra space | Returns maximum repeating element in arr [ 0. . n - 1 ] . The array elements are in range from 0 to k - 1.
Iterate though input array , for every element arr [ i ] , increment arr [ arr [ i ] % k ] by k.
Find index of the maximum repeating element.
Return index of the maximum element.
Driver program to test above function"
Solution in Python:
assistant
#Here is code to find the maximum repeating number in O ( n ) time and O ( 1 ) extra space and the other steps required.
 def maxRepeating ( arr , n , k ) :
	for i in range ( 0 , n ) :
		arr [ arr [ i ] % k ] += k
	max = arr [ 0 ]
	result = 0
	for i in range ( 1 , n ) :
		if arr [ i ] > max :
			max = arr [ i ]
			result = i
	return result
arr = [ 2 , 3 , 3 , 5 , 3 , 4 , 1 , 7 ]
n = len ( arr )
k = 8
print ( " The ▁ maximum ▁ repeating ▁ number ▁ is " , maxRepeating ( arr , n , k ) )