# Winding Number Point In Polygon: Interview Notes

Winding Number Point In Polygon shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sum signed angle changes, or equivalently count crossings with a horizontal ray using edge orientation, to decide inside versus outside for non-convex polygons.

## 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).

## Common mistake

Using an even-odd xor on a self-overlapping polygon when the problem asked for nonzero winding.

## 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 copilot.