Find the most frequent digit
Submissions: 2461   Accuracy:

32.04%

  Difficulty: Easy   Marks: 2

Given a number N, find the most occurring digit in it. If two or more digits occur same number of times, then return the highest of them. Input number is given as a string.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the number N

Output:
Print the most occurring digit in the number. If two or more digits occur same number of times, then print the highest of them. Print the answer for each test case in a new line.

Constraints:
1<= T <=100

1<= N <=101000

Example:
Input:
1
12234

Output:
2

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.