Skip to content

problem10.md

Latest commit

 

History

History
14 lines (10 loc) · 443 Bytes

problem10.md

File metadata and controls

14 lines (10 loc) · 443 Bytes

Problem 10: The Unique Pathfinder (Unique Paths)

Problem Statement

A robot is located at the top-left corner of an m x n grid. 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. How many possible unique paths are there?

Input Format

  • Two integers m and n.

Constraints

  • 1 <= m, n <= 100

Example

Input: m = 3, n = 7
Output: 28