I trying to come up with a way of parsing a string of any length to find a "sudoku definition" inside it.

A sudoku definition is a string of 81 numbers from 0 to 9 including ".". The zeroes and .s indicate blank squares.

What I really didn't want to do was start from each character and check the next 80 characters for an "incorrect" character. As this would mean parsing the entire string many times.

The solution I came up with was really quite good

In psuedo code...



By doing it this way I could potentially be moving through the string 81 characters at a time. It only then starts to "slow down" when it begins to see a sudoku definition and will always find it

One thing I don't do is validate the grid but that is something maybe for the next version

I was really pleased with it though