search

ayushi-ras / beginner-contribution-

Beginners Friendly
MIT License
13 stars 64 forks source link

leetcode #46

Open AMITKUMAR24-C opened 1 year ago

AMITKUMAR24-C commented 1 year ago

There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.

Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right corner.

The test cases are generated so that the answer will be less than or equal to 2 * 109.

Haris-Mohanty commented 1 year ago

@AMITKUMAR24-C , Please add desc!

AMITKUMAR24-C commented 1 year ago

Added