Problem 63 of 75

Unique Paths

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

A robot starts at the top-left of an m x n grid and can only move right or down. Return the number of unique paths to reach the bottom-right corner.

(3,7) → 28 (3,2) → 3

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Unique Paths, explainedNeetCode