A year is a little extreme, but glad to see you did it!

It was very difficult for me. I even gave up CodeWars for a year because I couldn't solve this problem in 2023. I don't like my solution because it's clumsy. But it worked! I'm glad I was able to solve this!

good for you man, im still timing out from using the backtracking approach :(

EDIT: I'm sorry, i used some code on github for the solution. Before anyone says anything, I probably shouldn't have done that, however I have spent some time reading the code, and I can fully understand it now. I think the point of codewars is to learn, but sometimes give up if it is too difficult. And for the reason why I did that, well, it's late now, so I got frustrated and just copy pasted some code off the internet.

This was a very challenging and fun kata! It required a lot of thought about which data structure and which algorithm to use to minimize the number of computations. In the end it was worth it and I managed to pass it marginally.

well, this one is insane

A correctly composed Sudoku must have a unique solution !

timing out from backtrack :(

js plz

Its 5 per test.

How many assertions per test? In my 100 random tests I've got 255 assertions passed but still timing out.

because that's a code working only for python 2

This code doesn't seem to pass when I copy and paste it.
range(1, 6) should equal [1, 2, 3, 4, 5]

?

У меня без list(...) не получилось, но это круто что у тебя так получилось

lol why was this downvoted