Minimum falling path sum
Given an n x n integer matrix, a falling path picks one element from each row such that adjacent rows' chosen columns differ (you may not pick the same column in two consecutive rows). Return the minimum sum of such a falling path. The matrix is square with n between 1 and 200, values may be negative.
Implement
min_falling_path_two(grid: list[list[int]]) → intExamples
in
[[[1,2,3],[4,5,6],[7,8,9]]]out13What 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 35 min
solution.py
InputExpectedGot
[[[1,2,3],[4,5,6],[7,8,9]]]13not run yetsample