Given below are the most common Grid/Maze problems
|
Problems |
Links |
|---|---|
| Rat in a Maze | |
| Rat in a Maze Problem when movement in all possible directions is allowed | |
|
Rat in a Maze with multiple steps or jump allowed |
|
| Unique paths in a Grid with Obstacles | |
| Count number of ways to reach destination in a Maze | |
|
Minimum distance to the end of a grid from source |
|
| Shortest path in a Binary Maze | |
| Find paths from corner cell to middle cell in maze | |
| Geek in a Maze | |
| Minimum moves required to come out of a grid safely | |
| Minimum Initial Points to Reach Destination | |
| Moving on grid | |
| Minimum cost to cover the given positions in a N*M grid | |
| Collect maximum points in a grid using two traversals | |
| Number of ways to go from one point to another in a grid | |
| Maximum Score by travelling from (1, 1) to (N, N) on grid |
Tutorial on Path Problems in a Grid, Maze, or Matrix
Path in a Grid or Maze refers to problems that involve navigating through a grid-like structure from the source (starting point) to the destination (endpoint) while avoiding the obstacles i.e., following rules and constraints.
Path in a Maze/Grid