Topic: Dynamic Programming Problem / Level: intermediate

Problem: Compute the minimum cost to traverse a grid where some cells have penalties and others have rewards using dynamic programming.

Run the code to see the output here...