Topic: Dynamic Programming Problem / Level: intermediate

Problem: Find the minimum cost to reach the last cell of a grid with obstacles and special powers using dynamic programming.

Run the code to see the output here...