#1186Hard· asked at 2 companies
Minimum Cost to Cut a Stick
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: n = 7, cuts = [1,3,4,5] Output: 16
Cutting in the order [3, 5, 1, 4] costs 7 + 4 + 3 + 2 = 16.
Example 2
Input: n = 9, cuts = [5,6,1,4,2] Output: 22
Constraints
- •
2 <= n <= 10^6 - •
1 <= cuts.length <= min(n - 1, 100) - •
1 <= cuts[i] <= n - 1 - •
All the integers in
cutsarray are distinct.