Skip to main content
Unique Paths | AlgoCracked
AlgoCracked
ProblemsUnique Paths
Medium64.0% acceptance
Dynamic ProgrammingMathCombinatorics

Unique Paths

A robot sits on the top-left cell of an m × n grid and wants to reach the bottom-right cell. It may move only right or down . Return how many distinct paths it can take. Input format Input is [m, n] (rows then columns), e.g. [3,7] .

Loading workspace…