# Find Valid Matrix Given Row And Column Sums: Study Guide
Find Valid Matrix Given Row And Column Sums shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Fill a matrix with non-negative ints matching given rowSum and colSum. Repeatedly put min(rowSum[i], colSum[j]) at (i,j) and subtract; advance the exhausted index.
## 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) placements, O(nm) writes.
## Common mistake
Distributing evenly and then fixing (can go negative) or using random values that miss the exact sums.
## 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 coding interview assistant.