Question

(Place your answer to this problem in the “count_largest.py” file)
Complete the count_largest() function, which takes a single positive (non-zero) integer as its argument. This function identifies the largest digit in the argument/parameter and returns an integer value that represents the total number of occurrences of that digit. For example, the largest digit in 4234 is 4, and it appears twice.
Thereareseveralwaystosolvethisproblem,mostofwhichinvolvePythonfunctionsorconceptsthatwehaven’tcoveredin class yet, but it’s definitely possible to solve it using only what we know right now. In particular, we can use a while loop and the modulo (%) operator to process the input value from right to left, removing one digit at a time for examination

Answer 1

ANSWER :

def count_largest(num):
    if (num < 0):
        num = num * -1
    val = num
    maxVal = -1
    count = 1
    while(val != 0):
        rem = val % 10
        if(rem == maxVal):
            count += 1
        else:
            if (rem > maxVal):
                maxVal = rem
                count = 1
        val = val // 10
    return count


#Testing
print(count_largest(4234))