Path Counting on a Grid
Sum paths from corner to corner.
The Classic Grid Problem
You start at the top-left of a grid and want the bottom-right. Each step moves right or down. How many distinct paths exist?
Why DP Fits
Every cell can be reached from the cell above or the cell to its left. That overlap is exactly why this is a DP problem.
All lessons in this course
- Path Counting on a Grid
- Minimum Path Sum with Obstacles
- Longest Common Subsequence
- Edit Distance Step by Step