Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

0 votes

Sudoku hidden sets algorithm

I think that yes, a 'brute force' O(n^2) approach gives the upper bound for the complexity. Of course that is feasible, but not necessarily desirable. With an iteration over the board, we are ...
grumpy's user avatar
  • 1

Top 50 recent answers are included