Back to DSA sheet

Unique Paths

MediumDynamic Programming
Open on LeetCodeAmazonGoogleMeta

Count the paths a robot can take from the top-left to the bottom-right of an m x n grid moving only right or down.

Constraints
  • 1 <= m, n <= 100
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
unique-paths.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.