# Self Crossing: Practice Notes
Self Crossing shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
An axis-aligned path crosses itself in a few local patterns: the 4th, 5th, or 6th segment can hit an earlier one. Check those cases against the last six lengths; you do not need a full geometric set.
## 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
Simulating every segment intersection in O(n^2) and missing a touch-at-a-point if the prompt counts that as crossing.
## 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 AI help for online coding assessments.