Leetcode 1547. Minimum Cost to Cut a Stick

Given positions where a stick must be cut and with each cut costing the current segment length, find the order of cuts that minimizes total cost — a classic interval-dynamic-programming problem (akin to matrix-chain/optimal BST) where you choose cut points to minimize summed segment lengths.