Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5271 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4356 |

@sanjay05 | 3762 |

@mantu_singh | 3638 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 871 |

@akhileshkumar562002 | 862 |

@pradeeppatidar1999 | 840 |

@kanewilliamson123 | 837 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@virgat | 768 |

Complete Leaderboard |

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.

**Example 1:**

**Input**:
N = "12234"
**Output**:
2
**Explanation **:
2 occurs most times

**Example 2:**

**Input**:
N = "1122"
**Output**:
2
**Explanation **:
1 and 2 occurs most times but 2 > 1.

**Your Task**:

You don't need to read input or print anything. Your task is to complete the function *solve() *that receives a string N as input parameter and returns the most frequent digit in it as a string.

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

**Expected Space Complexity** : O(1)

**Constraints**:

1<= len(N) <=101000

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...

Find the most frequent digit

...