Opening the reading…
Opening the reading…
DSA FUNDAMENTALS › RECURSION BASICS
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Complete the recursive function so it counts all five digits of 50720, including the final 0, and prints 5. Keep the recursive case as 1 + countDigits(n / 10), and use the correct return value when n < 10.
OUTPUT
Sample5
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.