FilesExpand file tree

 master

/

MaxRepeatingNumber.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (32 loc) · 1.06 KB

 master

/

MaxRepeatingNumber.java

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (32 loc) · 1.06 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

package com.interview.array;

/**

* http://www.geeksforgeeks.org/find-the-maximum-repeating-number-in-ok-time/

* Given an array of size n, the array contains numbers in range from 0 to k-1

* where k is a positive integer and k <= n.

* Find the maximum repeating number in this array

*/

public class MaxRepeatingNumber {

public int maxRepeatingNumber(int arr[], int k){

int len = k;

for(int i=0; i < arr.length; i++){

arr[arr[i]%len] += len;

}

int maxRepeating = 0;

int maxRepeatingIndex =0;

for(int i=0; i < len; i++){

if(maxRepeating < arr[i]){

maxRepeating = arr[i];

maxRepeatingIndex = i;

}

}

for(int i=0; i < len; i++){

arr[i] = arr[i] % len;

}

return maxRepeatingIndex;

}

public static void main(String args[]){

MaxRepeatingNumber mrn = new MaxRepeatingNumber();

int arr[] = {2,2,1,3,1,2,0,3,0,0,0,4,5,4,4,4,4};

System.out.println(mrn.maxRepeatingNumber(arr, 6));

}

}