Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given a grid where each cell represents a traversal cost. Find the minimum cost to travel from the top-left corner to the bottom-right corner of the grid, moving only down or right.