Your question is Spiral Search Implementation. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
An ASML YieldStar-style measurement grid stores integer readings in a rectangular matrix. Implement a clockwise spiral search that starts at the top-left cell and returns the coordinates of the first cell containing target.
Traverse the outer boundary from left to right, then top to bottom, then right to left, then bottom to top. Continue inward until the target is found or every cell has been visited.
Implement spiral_search(grid, target).
grid is a non-empty rectangular list of lists of integers.target is an integer.[row, column] for the first occurrence of target in clockwise spiral order.[] if target does not occur.def spiral_search(grid, target):