title: How to solve Kakurasu Puzzle in an efficient time?
body: <p>I'm trying to write a code in Java to find a solution of an instance of a Kakurasu puzzle in an efficient time. I was thinking about using dynamic programming but couldn't figure out how to do that.</p>