Minimum path sum
Given an m x n grid of non-negative numbers, return the minimum path sum from top-left to bottom-right, moving only right or down.
Implement
min_path_sum(grid: list[list[int]]) → intExamples
in
[[[1,3,1],[1,5,1],[4,2,1]]]out7What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[[1,3,1],[1,5,1],[4,2,1]]]7not run yetsample