We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Think bottom up. For each number on the triangle, what do you need to calculate the maximum-sum path to it? (Hint: the maximum-sum path to the one or two options above it).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #67: Maximum path sum II
You are viewing a single comment's thread. Return to all comments →
copy / pasted from Euler 18.
Think bottom up. For each number on the triangle, what do you need to calculate the maximum-sum path to it? (Hint: the maximum-sum path to the one or two options above it).