# Maximum Matching Of Players With Trainers: Interview Notes

Maximum Matching Of Players With Trainers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

players[i] needs a trainer with ability >= that value. Each trainer trains at most one player. Sort both arrays and greedy two-pointer: walk trainers from weakest, assign the next still-unmatched weakest player they can handle.

## 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 log n + m log m).

## Common mistake

Assigning the strongest trainer to the weakest player first (wastes capacity) or matching without sorting.

## 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 AI copilot.