Unique Paths
Last updated
What is Unique Paths?
A robot starts at the top-left of an m by n grid and can only move right or down. Find the number of unique paths to the bottom-right. Each cell's count is the sum of the cell above and the cell to the left. This is the simplest 2D DP problem and teaches you to think in terms of a grid where each cell builds on its neighbors.
Free resources to learn Unique Paths
More in stage 17: D Dynamic Programming
Unique Paths: common questions
Can I learn Unique Paths in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Unique Paths in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Unique Paths tutorial for beginners?
It is lesson 104 of 137 in the free LeetCode roadmap, in stage 17, D Dynamic Programming. If you are new to LeetCode, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.