As always, feel free to solve this problem on your own. However, I would like you to think about the problem recursively. That may not be the most natural way for you to think about it, but it's good practice.

One of the keys to this problem is to turn low and high into strings and work on the strings. Here's how you can do it.

Go ahead and turn this definition into a recursive solution.

I know you can do this with one for loop after you've created l and h. However, I'd like you to structure it with recursion. It's good practice.