Recursion: Count The Digits

Instructions

Code

Resources

Solutions

Comments

Create a function that will recursively count the number of digits of a number. Conversion of the number to a string is not allowed, thus, the approach is recursive.

Examples

digitsCount(4666) ➞ 4

digitsCount(544) ➞ 3

digitsCount(121317) ➞ 6

digitsCount(0) ➞ 1

digitsCount(12345) ➞ 5

digitsCount(1289396387328L) ➞ 13

Notes

You are expected to solve this challenge via recursion.
You can check on the Resources tab for more details about recursion in Java.
An iterative version of this challenge can be found via this link.
A collection of challenges alike can be found via this link.

Watch a quick demo on how Edabit works.

Tests

Console