← AlgoMindset 75

Unique Paths

Medium🎙 Interview me on this

🧠 Before you code — what pattern fits?

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

🎬 Video explanation · NeetCode

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.