# Minkowski Sum Of Convex Polygons: Walkthrough
Minkowski Sum Of Convex Polygons shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Merge the edge vectors of two convex polygons in slope order; the resulting chain is the convex Minkowski sum.
## 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 + m).
## Common mistake
Sorting edges by length instead of polar angle, which produces a self-intersecting chain.
## 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 the Linkjob AI app.