Minimum Path Sum at Goldman Sachs
Medium67.8% acceptance
This problem has 62.5% frequency at Goldman Sachs.
Problem 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. **Note:** You can only move either down or right at any point in time.
Read full problem and hintsTopics
Also asked at 16 companies
More Goldman Sachs Questions
Trapping Rain WaterHardMedian of Two Sorted ArraysHardContainer With Most WaterMediumSearch in Rotated Sorted ArrayMediumDecode WaysMedium
View all Goldman Sachs questions