Add some prints to debug your code, and some counters to make sure your loops end. You'll see you have infinite loops. It fails with the first sample test if you want to try.

Ah correct, I was calling the function instead of returning the function call. Everything passes, thank you

Yes, if you print the value to the console but the recursion came back as undefined is because you aren't returning the call to the function normally.

Can you explain how you came to that conclusion?

You're doing recursion wrong.

It's not time complexity, your code has infinite loops.

thx!

return; return what?

And your code will fail with bigger values, read this again:

take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced.

spoiler flag, please.