Topic: Greedy Algorithm Problem / Level: intermediate

Problem: You are given a grid of city blocks, where each block has a different traversal cost. Find the minimum cost to travel from the top-left corner to the bottom-right corner.

Run the code to see the output here...