# Maximum Number Of Achievable Transfer Requests: Explained

Maximum Number Of Achievable Transfer Requests shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

There are at most 16 requests. Enumerate every subset (or backtrack) of transfers; a subset is valid when every building’s net change is 0. Track the largest valid subset size.

## 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(2^m * n).

## Common mistake

Treating it as a flow without the “each request is all-or-nothing” constraint, or forgetting buildings that only send or only receive.

## 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 tool for job interviews.