Skip to content
the poor coder

Home / Topics / #dynamic-programming

#Dynamic Programming

4 posts
2021

Leetcode - Triangle Solution

Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either…

ESC