Problems Involving Grids - 3
Explore methods to calculate the number of ways to reach a specific position in a grid using dynamic programming. Learn how to handle blocked cells by applying memoization and iterative checks, enabling efficient solutions to pathfinding challenges in grids.
We'll cover the following...
We'll cover the following...
Problem statement
The problem in this lesson tries to solve the following type of question:
Finding the number of ways to reach a particular position in a grid from a starting position (given that some cells are blocked).
The problem statement is as follows:
The input is three integers, M, N, and P, each denoting the number of rows, number of columns, and number of blocked cells respectively. In the next P lines, each line has exactly 2 integers, i and j, denoting that the cell (i, j) is blocked. Find ...