# Maximum Bags With Full Capacity Of Rocks: Study Guide

Maximum Bags With Full Capacity Of Rocks shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Bag i has capacity[i] and already rocks[i]. You have extra additionalRocks. A bag is full when rocks == capacity. Greedy: sort bags by remaining capacity (capacity - rocks) and fill the cheapest ones first until the extra rocks run out. Count how many end up full (including those already full).

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

## Common mistake

Filling the largest remainders first (that wastes rocks) or not counting bags that were already full.

## 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 coding interview assistant.