LeetCode 62: Unique Paths — Step-by-Step Visual Trace
Medium — Dynamic Programming | Math | Combinatorics | Grid
The Problem
Find the number of unique paths from the top-left corner to the bottom-right corner of an m x n grid, where you can only move right or down.
Approach
Use dynamic programming with ...
blog.tracelit.dev1 min read