Minimum Falling Path Sum II (LeetCode 1289)
HardLeetCode 1289 · 2D Grid · Google, Meta +2 · 1:05:23Minimum Falling Path Sum II · 4 Approaches · Detailed Dry Run · Leetcode 1289My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 1289 Minimum Falling Path Sum II by codestorywithMIK: Dynamic Programming, Hard. Topics: Array, Dynamic Programming, Matrix. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Dynamic Programming, Matrix
- Patterns
- 2D Grid
- Chapter
- Dynamic Programming
- Duration
- 1:05:23
Related problems
- Unique Paths (LeetCode 62)
- Unique Paths II (LeetCode 63)
- Maximum Non Negative Product in a Matrix (LeetCode 1594)
- Dungeon Game (LeetCode 174)
- Find the Maximum Number of Fruits Collected (LeetCode 3363)
- Minimum Falling Path Sum (LeetCode 931)
- Minimum Path Sum (LeetCode 64)
- Number of Ways of Cutting a Pizza - (Google, TikTok) (LeetCode 1444)