We can think of this as a normal array and use a helper function to get indexes correct and run a simple binary search algorithm.
My first thought is pretty straightforward. I can start from the top-left corner and move right. Once I reach the boundary, I turn down, then left, then up. But how do I know whether I’ve already ...