# Find The Kth Smallest Sum Of A Matrix With Sorted Rows: Practice Notes

Find The Kth Smallest Sum Of A Matrix With Sorted Rows shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each row is sorted; pick one value per row and look at the k-th smallest possible sum. Start from the smallest sum (all row[0]) and use a min-heap BFS that advances one row at a time to the next column, with a visited set of column-tuples (or a smarter bounded search). A binary search on the sum plus counting would also work.

## 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(k * n * log k) typical heap.

## Common mistake

Generating every combination (product of row lengths) when k is much smaller.

## 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 help for online coding assessments.