Problem 1483. Number of paths on a grid

• Created by G K
Consider a grid formed by n vertices vertically down, and m vertices horizontally right. Your starting point is at the top left vertex. Your destination is the bottom right vertex. You are permitted at each vertex to choose to move down or right, that is in the direction towards the destination. You are not to move on what constitutes a back step like moving left or up. If you hit the bottom boundary, or right boundary take it to be given there is only 1 way to the destination, that is following along the boundary.
Ex: in a 2x2 grid there are two ways. One way: First down, then right. The other way: First right, then down.
4x3 has 10 ways
6x5 has 126 ways
This problem can be solved using dynamic programming but there are other methods too.
Problem 7) Prev: 1482 Next: 1484

Solution Stats

58.33% Correct | 41.67% Incorrect
Last Solution submitted on Apr 12, 2024

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!