Basic Problemsminimizationgrid
Min Sum in a Triangle
Given a triangular arrangement of numbers, and starting at the top while moving down to one of the two adjacent numbers on the row below at each step, find the smallest possible sum along any path to the bottom row.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.