# Min Plus Convolution Convex: Explained
Min Plus Convolution Convex shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
When one array is convex, the min-plus convolution opt[i+j] = min (a[i] + b[j]) can be computed by SMAWK or a divide-and-conquer on monotone argmins.
## 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) or O(n log n) depending on the method.
## Common mistake
Running the monotone search on a non-convex array, which reports a local rather than global minimum.
## 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.