the most obvious and easiest approach is recursion but it is not strictly required

This is becuase n squared is equal to 144. The sum of 1, 2, 3, 7, 9 all squared gives that solution but 1, 2, 4, 11 does not. It equals 142.

Interesting lol nice job

That's works but you can try another solutions, using more language features. Don't be satisfied solving just the problems try to go a little more further, It's a good thing I'm telling you by experience.

Seems like you may have over thought it a little bit lol

So, are you saying that your solution is better in regards to time space complexity?

Thanks for pointing that out. I was not putting enough thought into the assertions and couldnt figure out where it was hanging up.

Cool, I solved it almost the exact same way.

Cool, I solved it almost the exact same way.

Cool, I solved it almost the exact same way.

Cool, I solved it almost the exact same way.

Cool, I solved it almost the exact same way.

There is still a typo in that sentence.