# Slope Trick Piecewise Linear: Walkthrough

Slope Trick Piecewise Linear shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Represent a DP value as a piecewise-linear convex function stored by the slopes' breakpoints in a pair of heaps, so a min-plus update becomes a heap push.

## 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(n log n) when each transition inserts one breakpoint.

## Common mistake

Inserting a breakpoint into the wrong heap (left vs right of the current minimum), which moves the function's vertex.

## 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 Linkjob AI.