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

daww the heart is cute <3

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

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

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

Why would you ever use this? It's less readable, slower and takes longer to type than the standard python way

How does this ensure that the letters come out in the right order?

I get a missing substring error here but a normal output with the same code in my own program. Is that a thing?

So clever to return two slices instead of a full variable