Available question text
Given an array of positive integers as the in-order leaves of a full binary tree, choose the tree shape that minimizes the sum of internal-node values where each internal node's value equals the product of the largest leaf in its left and right subtrees. This is an optimal parenthesization/segmentation problem (n ≤ 40) often solved by DP or a monotonic-stack greedy strategy.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Cost to Disconnect All Leaf Nodes
Coding
- They asked me to implement a balanced binary search tree from scratch and explain its time complexity. They also wanted me to optimize it for handling duplicate values
Coding
- Build a binary tree from array
Coding
- Build Binary Expression Tree From Infix Expression
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1130. Minimum Cost Tree From Leaf Values
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source