Unique Paths in 2D grid | PROGRAMMING INTERVIEWS
Question: There is an m x n grid. One can only move either down or right at any point in time. One is trying to reach the bottom-right corner of the grid.How many possible unique paths are there?
Below is an example of 4x4 grid. Here from moving top-left to bottom right corner, we will have 20 unique paths.
Read full article from Unique Paths in 2D grid | PROGRAMMING INTERVIEWS
No comments:
Post a Comment