Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given a grid of integers representing city blocks where each cell represents a traversal cost. Find the minimum cost path from the top-left corner to the bottom-right corner of the grid.