Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4408 |

@sanjay05 | 3762 |

@mantu_singh | 3666 |

@gfgaccount | 3605 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 953 |

@kanewilliamson123 | 894 |

@pradeeppatidar1999 | 868 |

@akhileshkumar562002 | 862 |

@wallflowe101 | 826 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@nikhilkushwah280 | 796 |

Complete Leaderboard |

Given an array **Arr** of size ** N**, the array contains numbers in range from

**Example 1:**

**Input:
**N = 4, K = 3
Arr[] = {2, 2, 1, 2}
**Output: **2
**Explanation:** 2 is the most frequent
element.

**Example 2:**

**Input:
**N = 6, K = 3
Arr[] = {2, 2, 1, 0, 0, 1}
**Output:** 0
**Explanation:** 0, 1 and 2 all have same
frequency of 2.But since 0 is smallest,
you need to return 0.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **maxRepeating()** which takes the array of integers **arr,** **n** and **k **as parameters and returns an integer denoting the answer.

**Expected Time Complexity:** O(N)

**Expected Auxiliary Space:** O(K)

**Constraints:**

1 <= N <= 10^{7}

1 <= K <= N

0 <= Arr_{i} <= K - 1

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Maximum repeating number

...