Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Hey lil2 I can't see your reply because I haven't solved the kata yet 😅
Can we talk over the discord? My username there is: rodonoah#5282
This comment is hidden because it contains spoiler information about the solution
interesting kata! every elevator trip will look different now
very clever
very cool kata that requires an elegant solution
very enjoyable kata. It became one of my favs.
Very nice kata! The whole process was very satisfying, including the research.
EDIT: The problem was in my code, nevermind
This kata should be ranked as 3 or even 2 kyu imo. The test cases make it way more challenging performance wise than what the description suggests. Additionally, it would be very helpful to include the harder test cases in the description.
same here but for python
My code is raising an error for the following input:
[0, 0, 0, 7, 0, 0, 0, 0, 0]
[0, 0, 8, 0, 4, 9, 0, 1, 0]
[0, 0, 5, 8, 0, 0, 0, 6, 0]
[8, 0, 9, 0, 0, 0, 6, 0, 0]
[0, 0, 0, 9, 0, 3, 0, 0, 0]
[0, 0, 2, 0, 0, 0, 4, 0, 9]
[0, 6, 0, 0, 0, 2, 7, 0, 0]
[0, 2, 0, 5, 1, 0, 9, 0, 0]
[0, 0, 0, 0, 0, 4, 0, 0, 0]
However it seems the input is lacking commas between the elements (And if this was on purpose my code would pass the test since it raises a ValueError).
If I manually add the commas back and run the code on my editor I get the right single solution:
[2, 1, 4, 7, 5, 6, 3, 9, 8],
[6, 3, 8, 2, 4, 9, 5, 1, 7],
[7, 9, 5, 8, 3, 1, 2, 6, 4],
[8, 7, 9, 4, 2, 5, 6, 3, 1],
[1, 4, 6, 9, 7, 3, 8, 5, 2],
[3, 5, 2, 1, 6, 8, 4, 7, 9],
[9, 6, 1, 3, 8, 2, 7, 4, 5],
[4, 2, 3, 5, 1, 7, 9, 8, 6],
[5, 8, 7, 6, 9, 4, 1, 2, 3]
Any thoughts?
This is crazy smart
Same issue here
I mean, I tested the code against a few cases in my IDE and it passed, but I guess it's not efficient enough to pass codewars efficiency requirements...
However I don't know how to further optmize it. This is what I got
Timed out... although the code works