# Maximum Number Of Tasks You Can Assign: Study Guide

Maximum Number Of Tasks You Can Assign shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

tasks[i] strength needed, workers[j] strength, pills give +strength, at most pills pills. Binary search the number k of easiest tasks; try to assign the k strongest workers, greedily using a pill on the weakest worker who still can (multiset of those workers).

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

## Common mistake

Always giving pills to the strongest workers, which can waste pills on tasks a weaker worker plus a pill could have taken.

## 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 best AI tool for coding tests and OAs.