Leetcode 62 Unique Paths | Dynamic Programming | Bottom-Up

Leetcode 62 Inspiration:
This is a typical bottom-up dynamic programming problem. In every position, its value is the sum of left and up. You could keep an m*n array to keep track of every state in the grid, or optimize the auxiliary space to O(n).

Timeline:
00:00 Problem Analysis

#dynamicprogramming #bottomup