Explorer Maze Escape
Premium Content - Free Preview
The Java Explorer is back, but his sensors are broken! You'll need to help him find the path to the goal. Given a map of the area (as a square grid), can you help the Explorer find the way from position
[0,0] to the goal? The explorer can go right or down within in the grid, and cannot go through walls.
t for t test cases. Each test case consists of:
n for the size of the area
n*n square consisting of 0's, 1's and one 9.