IBM OA Question 2024 August | Dynamic Programming | on-campus

Question: Minimum Path Sum Problem Statement 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. Note: You can only move either down or right at any point in time. Constraints m == grid.length n == grid[i].length 1 <= m, n <= 200 0 <= grid[i][j] <= 200 Examples Example 1: Input: grid = [[1,3,1],[1,5,1],[4,2,1]] Output: 7 Explanation 1: The path ...