# Find The Number Of Ways To Place People I: Explained
Find The Number Of Ways To Place People I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count pairs of points that can be the upper-left and lower-right corners of an empty rectangle; check no third point lies inside.
## 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^3) for the easy constraints.
## Common mistake
Allowing a point on the border when the problem forbids it, or swapping upper-left with lower-right.
## 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.