i cant understand

10 months ago and nobody fixed it yet? Wow!

why am I laughing at this? I just imagined it in my head. I can't laugh

They must have been style choices or something. I liked the way the < 1 and < 2 lined up, and I wanted to look cool using more recursion

why not n==0 when the only input smaller than 1 is 0
why converting the input to a string instead of just using the string "0" when it is always the same constant value?
same applies for second line, plus why using solve(n-1) when can not be anything else than 1

with the usage of

if n < 1: return "0"
if n < 2: return "01"

there would be so many less string conversions and depths of recursion

frfr

Thanks for the reply. Ill give it a go later. Im a JavaScript guy but I started learning Python yesterday and am totally engrossed. There's so many online resources, one can pick up a new language fairly quickly it seems. I chose Python after seeing a comment by an cw admin on how easy it was to learn.

I think it shouldn't matter for most kinds of solutions.

This looks like a good kata and wanted to try it but I don't know how to count the occurrences of non-ascii characters, so I'll have to pass. Googled it but couldn't find anything definitive.

Didn't know about those, thanks

Operation lib __add__, __sub__, __truediv__, __mul__ are faster than lambdas. yoou could be faster with it.

@FArekkusu

Are you sure this code is O(n^2)? It appears to me that it is O(n), as it loops as many times as there are segments of 8 bytes in the input list

for this time i dont know that the Set can work so, it's a real magic for me, it's realy awesome

I've actually removed that requirement. As you said, it can't be tested.

i dont think this is an issue, because the semantics are different: (named) tuples are immutable, while class instances are mutable