Day 29 of June LeetCode Challenges

Aanchal Patial
1 min readJun 29, 2020

A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).

The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).

How many possible unique paths are there?

--

--

Aanchal Patial

We never really grow up, we only learn how to act in public