Find the most frequent digit without using array/string - GeeksforGeeks

Find the most frequent digit without using array/string - GeeksforGeeks

Find the most frequent digit without using array/string

Given an integer, find the most occurring digit in it. If two or more digits occur same number of times, then return the highest of them. Input integer is given as an int variable, not as a string or array. Use of hash or array or string is not allowed.

Example:

Input:  x = 12234  Output: The most frequent digit is 2    Input:  x = 1223377  Output: The most frequent digit is 7    Input:  x = 5  Output: The most frequent digit is 5    Input:  x = 1000  Output: The most frequent digit is 0  

We strongly recommend you to minimize your browser and try this yourself first.
We could create a map of size 10 and store count of all digits, but use of any array/string is not allowed.

The idea is simple, we write a function that counts occurrences of a given digit in a given integer. Then we count all digits from 0 to 9 in given integer. We keep updating maximum count whenever count becomes more or same as previous count. Below is C++ implementation.

Read full article from Find the most frequent digit without using array/string - GeeksforGeeks