Interesting Interview Question: Check if a String is Rotated

Found an interesting interview question at Stackoverflow. How will you find a string ‘a’ is a rotated string of some string ‘b’ (say, or some other reference string, but known)? Example: a= ‘stackoverflow’, b = ‘overflowstack’, then ‘a’ is rotated string of ‘b’. a= ‘stackoverflow’, b= ‘flowrevostack’, then ‘a’ is NOT rotated string of ‘b’. [...]

And hence the sudoku is solved

J. F. Crook has provided a pencil and paper algorithm for solving the most celebrated puzzle – sudoku. This mathematical method explains how preemptive sets are used in solving them. I think, for solving sudoku this way you might need to know more math than what you need to know for sudoku.