id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

gaurav1780@gmail.com 07_recursion > count_digits_recursive
prev  |  next  |  chance

Define a tail optimised recursive function that when passed an integer (say n), returns the number of digits of that integer. You may assume n >= 0.


count_digits_recursive(1729) → 4
count_digits_recursive(0) → 0
count_digits_recursive(8) → 1

...Save, Compile, Run (ctrl-enter)

def count_digits_recursive(n):

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Python Help

Difficulty: 1 Post-solution available

Copyright Nick Parlante 2017 - privacy