Phew...! Eventually!

It took me ages to achieve the performance required to solve this kata. My initial algorithm took 11 seconds for a 67 rows by 59 columns reference shape. In the final solution I got this down to 0.038 seconds.

It's a great kata to develop techniques to identify where your algorithm actually spends time.

Nice one! Thank you!

Not quite there yet. I guess you are able to see an earlier version I submitted. I still haven't passed all the tests. I reckon I still have to improve the performance by a factor 3 to 4.

This kata got me into a russian doll of problems. You implement an algorithm to speed up one aspect of the solution, only to realise that this causes problems elsewhere. Once you fixed those, you need specialised code in another function. And so one and so forth ...

I have an idea now. Let me see if that works ...

Out of curiosity: would the solution code be much simpler when you try to solve this in C or C#? Has anyone tried? I'm going through hoops to achieve the performance required to solve this kata. Makes me wonder, if you encounter a challenge like this in a real life project, would this be an example for choosing a different programming language?

That's interesting. I do use dicts but I consciously avoided dependency on the order of keys. I must have done that somewhere unintentionally. I'll have a look.

Yes, just tested it. It works well with 3.6.0.

I just noticed: when I switch codewars Python version from 3.4.3 to 3.6.0 my code passes the "Yin-Yang" test. That's interesting. I need to figure out what causes this.

I have this odd behaviour that my code fails test case "Yin-Yang" on the codewars platform. It produces only two of the required three pieces. However, when I run it on my local machine (Windows 10, Python 3.7.3) it produces the expected three pieces. Is this an issue with the Python version? Any advise?

Great kata!

oops!

How can you have 0 Honor points after solving 1,002 katas: https://www.codewars.com/users/Hacker%20Sakana/stats ?

Ha! Otis is getting it's firmeware fixed on codewars. For free! :-D

Hello Thamos,

I think this guide answers your question: http://www.codewars.com/docs/ranking-and-honor-1

Nice one!

That's why I like codewars. You produce a 470 lines solution only to find someone else did it with 70 lines.