Grid-Dp
Grid DP
·2 mins
Algorithm
Dynamic-Programming
Grid-Dp
Counting, cost optimization, reverse resource DP, and local geometry
LeetCode 576: Out of Boundary Paths
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Out of Boundary Paths, rebuilt from the original learning note
LeetCode 1289: Minimum Falling Path Sum II
·3 mins
LeetCode
Hard
Dynamic-Programming
Grid-Dp
LeetCode note for Minimum Falling Path Sum II, rebuilt from the original learning note
LeetCode 931: Minimum Falling Path Sum
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Minimum Falling Path Sum, rebuilt from the original learning note
LeetCode 1277: Count Square Submatrices With All Ones
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Count Square Submatrices With All Ones, rebuilt from the original learning note
LeetCode 221: Maximal Square
·4 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Maximal Square, rebuilt from the original learning note
LeetCode 174: Dungeon Game
·3 mins
LeetCode
Hard
Dynamic-Programming
Grid-Dp
LeetCode note for Dungeon Game, rebuilt from the original learning note
LeetCode 64: Minimum Path Sum
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Minimum Path Sum, rebuilt from the original learning note
LeetCode 63: Unique Paths II
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Unique Paths II, rebuilt from the original learning note
LeetCode 62: Unique Paths
·3 mins
LeetCode
Medium
Dynamic-Programming
Grid-Dp
LeetCode note for Unique Paths, rebuilt from the original learning note