# Half Plane Intersection Kernel: Interview Notes
Half Plane Intersection Kernel shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Intersect half-planes in angle order with a deque of bounding lines to compute a convex polygonal kernel or feasible region.
## 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) after sorting, O(n) if already sorted.
## Common mistake
Popping a deque line that still bounds the intersection because the new half-plane was checked at the wrong endpoint.
## 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 this tool.