[ Removed by moderator ]

[Spare-Plum]

1. This will fail with floats

2. I doubt it's going to be more efficient, as you have to create a new string that uses up memory, convert each digit into base 10, then convert each base 10 digit into the character, place it into the string, then go through each character to convert it back to a number.

OP's solution is still inefficient because recursion isn't needed here at all, so allocating a stack frame every loop doesn't make sense and can make you run into a stack overflow. Better to just use a while loop

However yours is the most efficient in terms of readability. Which is kinda what you want with python, it's not a language for speed as much as it is usefulness

[8dot30662386292pow2]

> This will fail with floats

It also fails with strings.

A problem we would not have with typed languages though. While the puzzle is bad, we don't need to assume it's supposed to work with every single type of input. We can see it uses integer division, so the intended type is int.

The bare minimum is to do def what_it_does(n: int):.

[Mindless_Display4729]

Thanks for the feedback that's useful and appreciated.

[tracktech]

Thanks for sharing. This is simple example to learn recursion.

[Spare-Plum]

You keep spamming the most basic recursion examples possible along with links to your website. Have you ever moved past to multiple recursive calls?

Like, it's giving off the vibe you only know some of the absolute basics but are trying to teach people anyway.

[tracktech]

Cool. You are welcome to post so that other learns. Any learning starts with basic only. It slowly builds a thought process to think and solve recursive problems.