Aanchal PatialFollowApr 18, 2020·1 min readDay 18 of 30-Day LeetCode ChallengeGiven 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.Note: You can only move either down or right at any point in time.