Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given a grid representing a city, where each cell has a number representing the cost to pass through. Find the minimum cost to travel from the top-left corner to the bottom-right corner of the grid.