LeetCode #746 : Min cost climbing stairs
60 ms, faster than 44.27%
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
Random Ramblings about Life, the Universe, and Everything
This & That
dynamic_programming
LeetCode #931. Minimum Falling Path Sum
132 ms, faster than 38.27%
Given a square array of integers A, we want the minimum sum of a falling path through A.