# St Numbering Bipolar Orientation: Interview Notes

St Numbering Bipolar Orientation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Number vertices so every vertex except s and t has a lower and a higher numbered neighbor; this bipolar orientation is the backbone of several planarity algorithms.

## 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) after an ear decomposition or DFS.

## Common mistake

Assigning a vertex a number with no smaller neighbor, which breaks the bipolar property.

## 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 undetectable AI interview copilot.