Dynamic Programming - Session 3 - Number of Ways and Minimum Cost Type Problems

Problems 1. Number of ways to cross a 2D grid (Number of unique paths) 2. Minimum cost to climb stairs