# Find Smallest Common Element In All Rows: Study Guide
Find Smallest Common Element In All Rows shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each row of a matrix is strictly increasing. Count frequencies across rows (or binary-search each candidate from row 0 in the other rows) and return the smallest value that appears in every row.
## 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) counting or O(n * m log n) binary search.
## Common mistake
Flattening and sorting the whole matrix, which loses the per-row constraint and is slower to reason about.
## 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 interview copilot.