← Back to Recursion
Question 619
Largest Digit
Largest Digit
Write max_digit(n: int) -> int that returns the largest single digit in a non-negative integer, by recursion: a number below 10 is its own largest digit; otherwise store the largest digit of n // 10 in a variable rest, then return the last digit n % 10 when it is bigger than rest and rest otherwise. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one integer n, no prompt, which the tests read and pass to your function before printing the value it returns.
Expected Output:
9= newline. The output ends with a newline — print one after the last line.
Hints3 available
Sign in to use hintsTopics:
RecursionOperators
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (pr, inp, def)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.