# Minimum Cost To Cut A Stick: Practice Notes
Minimum Cost To Cut A Stick shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Add 0 and n to the cut list and sort. DP[i][j] = min cost to finish all cuts strictly between cuts[i] and cuts[j]; the cost of a cut at k is (cuts[j]-cuts[i]) plus the two subproblems. Interval DP in increasing gap.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(m^3).
## Common mistake
Greedily cutting at the midpoint each time, which is not always cheapest, or forgetting to add the current stick length to every cut.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.