# Maximum Performance Of A Team: Study Guide

Maximum Performance Of A Team shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort engineers by efficiency descending. Add each speed into a min-heap of size at most k, dropping the smallest speed when the heap overflows. Score is sumSpeed * the current (smallest) efficiency.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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).

## Common mistake

Sorting by speed instead of efficiency, which lets a low-efficiency engineer cap a strong team.

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