Original subtitles

All right.

So welcome back goes through another challenge, and this challenge is actually pretty similar to the

previous one.

What we are going to do here is simply to write the recursive function that will receive a number of

some Nahm, just like we've done previously.

But now, instead of finding out what will be the sum of all digits in a given number, what we are

going to find out is what is the total number of digits in these given numbers.

So, for example, if we have a Nahm as 67, as we said previously.

So what the recursive function is going to do now is simply to return the total amount of digits.

So if we know that sixty seven consists of six and seven, which is just two digits.

So the result of this function, the return value is going to be two.

And as the second example that we use previously, we have Nahmias, nine thousand five hundred thirty

one.

So how you calculate the total amount of digits.

You simply find out why.

How.

How many digits of this number has.

Okay.

Just by using this approach that we've shown in the previous challenge, just by dividing by 10 on every,

let's say, a recursive call and then taking just one digit and using some are some mechanism that we

know.

We take it into account.

So previously we took the whole digit into account.

We summed it up.

And now we simply are going probably to use some counter.

But I'll leave it to you guys.

Okay.

So take your time to think about it.

It's pretty similar to the previous exercise, but it also are kind of different.

So take your time.

Think of the solution and I'll see you in the Solutions video.

Good luck, guys.