Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Triangle

Explore how to solve the triangle minimum path sum problem with dynamic programming. Understand moving through adjacent numbers in rows below while optimizing with memoization and tabulation, improving your coding interview skills.

We'll cover the following...

Statement

Given an array, triangle, return the minimum path sum from top to bottom.

You may move to an adjacent number in the row below at each step. More formally, if you are at index ii in the current row, you may move to either index ii or index i+1 ...