I considered using recursion, but I later ended up with loop.
using recursion a great solution!!!

a clever use of the -1 return, it took me a second to catch up

aha! I was confused as to why the problem wanted you to return -1, now I can see that it sets you up for this solution...

Just clever!!

thats so elegant

This was my first solution, but I kept getting stack overflows because I forgot <=

Love it

reducing/recursing the height by multiplying with bounce and leaving the rest to the conditions... what a clever mind..

I spent such a long time trying to create a recursive function but ended up going the good old iterative way with a while loop.

Thank you for this! Smart

Strange that this answer is so far down. It seems like a classic recursion coding problem.

morevoer, asking for a string instead of the boolean makes no sense and that's a duplicate.

• Function name should be in snake_case
• The initial solution is broken
• No sample tests
• The solution can be spoiled by the tests
• The task is completely unoriginal and has NO value

& looks faster than %