Problem 142 of 333HardCodingP142

Number of paths in a grid

An $n \times m$ grid. You start at $(0, 0)$ and move to $(n - 1, m - 1)$ , only right or down. How many paths? Now add the constraint that certain cells are blocked.
See the hint and solution with a free account
Every problem on Quant Engine is free, with a hint and a full worked solution. Making an account takes 30 seconds and no card. Then you can see them and track what you have solved.
Create a free account Log in

See the hint and solution with a free account