Maximum Path Sum II (67)

In Problem 67, we're asked to find the maximum path sum in a bigger number triangle. It is the harder version of Maximum Path Sum I (18).

The brute-force version doesn't work here, the bottom-up version and Dijkstra's algorithm work very well, though.