I decided to try to make at least 4 different test cases for each different amount of digits.
First case is when neither the digit sum is not divisible by 25 nor is the integer. Second
case is a number where the digit sum is not divisible by 25 but the in
1. Sample Input
2. Sample Input
3. Sample Input
4. A pond with a radius of 100 and a hole of radius 5 right in the middle. Ensures that
the solution can handle a hole in the very center of the pond.
5. Minimum case, a pond of radius 1
Dave has become addicted to Sudoku, the latest puzzle craze in all the
newspapers and bookstands. In case you dont know, a Sudoku is a simple
number puzzle played on a 3x3 grid of 3x3 subgrids. Below is an example: