• ###### oasbnfioansfoin12commented on "Hard Sudoku Solver" kata

timing out from backtrack :(

js plz

• ###### neerajgopalresolved a question on "Hard Sudoku Solver" kata

Its 5 per test.

• ###### neerajgopalcreated a question for "Hard Sudoku Solver" kata

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

• ###### Blind4Basicscommented on "Count by X" python solution

because that's a code working only for python 2

• ###### jeremynslcommented on "Count by X" python solution

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

?

• ###### JoSevladcommented on "Count by X" python solution

This comment is hidden because it contains spoiler information about the solution

• ###### tsarartcommented on "Count by X" python solution

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

• ###### writeblankspacecommented on "Count by X" python solution

woah that's just amazing. I never fail to learn new things even in 8 kyu katas

• ###### grigrcommented on "Hard Sudoku Solver" kata

Very interest Kata :) Thank you
luckily i found the right method. my algorithm solved everything in 6 seconds, only on one Sudoku from your set it was required to take 1 step back.
also my algorithm solved in 2 seconds "the most difficult sudoku in the world" by taking 14 steps back. I'm glad that my program coped with it!

• ###### hobovskycommented on "Hard Sudoku Solver" kata

It depends what exactly you mean by "backtracking algorithm", but there's "hard" in the title for a reason.
My solution does not use backtracking at all.

• ###### janlos111commented on "Hard Sudoku Solver" kata

why is backtracking alorithm not efficient enough?? wat isnt it supposed to be the solution here

• ###### Encription0001commented on "Count by X" python solution

ive never heard a good programmer say "so what" before

• ###### profarvincreated a question for "Hard Sudoku Solver" kata

This comment is hidden because it contains spoiler information about the solution