We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
A fun exerise! Helps me understand DFS a bit better now. The key to performance is to always find the position which has the least number of candidates.
Each position has nine (1-9) candidates at first. Use the row, col and block information then the candidates can be reduced.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Project Euler #96: Su Doku
You are viewing a single comment's thread. Return to all comments →
A fun exerise! Helps me understand DFS a bit better now. The key to performance is to always find the position which has the least number of candidates.
Each position has nine (1-9) candidates at first. Use the row, col and block information then the candidates can be reduced.