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

Solution: Triangle

Explore how to find the minimum path sum in a triangular array using dynamic programming. Understand the bottom-up technique that calculates optimal paths from the base up, focusing on memoization and space optimization. This lesson guides you through implementing an efficient O(n²) time and O(n) space solution.

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 ...