# Leftmost Column With At Least A One: Interview Notes
Leftmost Column With At Least A One shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A binary matrix with each row sorted. You may only access mat.get(i, j). Start at the top-right and walk left on a 1 and down on a 0; the leftmost column where you ever stepped on a 1 is the answer (or -1). Binary-search each row also works.
## 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(m + n) staircase or O(m log n).
## Common mistake
Scanning the whole matrix (the API budget is tight) or binary-searching columns without checking every row.
## 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.