at least he got the job done

Easy to read, but it's O(n^2) and there's an even shorter solution that's O(n).

Yeah you are right, I forgot why I wrote that statement but it should be totally fine without it. I guess I wanted to do some validation on the parameters.

daww the heart is cute <3

I second that. Nice one, tdj

potresti spiegare la logica? funziona bene ma non capisco i passaggi logici, grazie mille.

would u please understand the logic, i don't get it but i like it. THX

nice, really small and neat result with no imports and still pretty fast

looks super neat, +points for short written solution with no imports!

see above (don't forget the spoiler flag ;) ).

looks neat but O(n**3) doesn't look so neat

oops forgot to delete the getFactors function before submitting lol

this is a bit wasteful since you calculate a sequence of fibonacci numbers for each fibonacci number <= n. you can calculate the whole fib seq <= n first and then iterate through it after, so you only calculate the fib seq once