# C++ Solution to Coding Challenge 120. Triangle

## An example of dynamic programming

# Problem statement

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 the index `i`

on the current row, you may move to either index `i`

or index `i + 1`

on…