{"ref":"master","ref_type":"branch","master_branch":"master","description":"Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.","pusher_type":"user"}