Matrix Path DP

Category: Dynamic Programming

Difficulty: intermediate

Description: Find unique or minimum paths in matrix

Time Complexity: O(mn)

Space Complexity: O(mn)

Related LeetCode Problems

• 62. Unique Paths (Medium)
• 63. Unique Paths II (Medium)
• 64. Minimum Path Sum (Medium)
• 120. Triangle (Medium)
• 329. Longest Increasing Path in a Matrix (Hard)
• 521. Longest Uncommon Subsequence I (Easy)
• 931. Minimum Falling Path Sum (Medium)
• 64. Minimum Path Sum (duplicate) (Medium)
• 980. Unique Paths III (Hard)
• 361. Bomb Enemy (Medium)
• 221. Maximal Square (Medium)
• 64. Minimum Path Sum (third) (Medium)