#3814Medium~35 min

Maximum Capacity Within Budget

Time O(n + b) · Space O(b) · Official statement on LeetCode

array hash map prefix sum sort stack binary search

Solutions

// Time:  O(n + b)
// Space: O(b)

// hash table, prefix sum
class Solution {
public:
    int maxCapacity(vector<int>& costs, vector<int>& capacity, int budget) {
        const auto& mid = (budget - 1) / 2;
        vector<int> lookup(budget);
        for (int i = 0; i < size(costs); ++i) {
            if (costs[i] >= budget) {
                continue;
            }
            lookup[costs[i]] = max(lookup[costs[i]], capacity[i]);
        }
        for (int i = 0; i + 1 <= mid; ++i) {
            lookup[i + 1] = max(lookup[i + 1], lookup[i]);
        }
        int result = 0, mx = 0;
        for (int i = 0; i < size(costs); ++i) {
            if (costs[i] > mid) {
                continue;
            }
            result = max(result, mx + capacity[i]);
            mx = max(mx, capacity[i]);
        }
        for (int i = mid + 1; i <= budget - 1; ++i) {
            result = max(result, lookup[i] + lookup[(budget - 1) - i]);
        }
        return result;
    }
};

// Time:  O(nlogn)
// Space: O(n)
// sort, mono stack
class Solution2 {
public:
    int maxCapacity(vector<int>& costs, vector<int>& capacity, int budget) {
        vector<int> idxs(size(costs));
        iota(begin(idxs), end(idxs), 0);
        sort(begin(idxs), end(idxs), [&](const auto& a, const auto& b) {
            return costs[a] < costs[b];
        });

        int result = 0;
        vector<pair<int, int>> stk;
        for (const auto& i : idxs) {
            const auto& cost = costs[i], &cap = capacity[i];
            if (cost >= budget) {
                break;
            }
            while (!empty(stk) && stk.back().first + cost >= budget) {
                stk.pop_back();
            }
            result = max(result, (!empty(stk) ? stk.back().second : 0) + cap);
            if (empty(stk) || stk.back().second < cap) {
                stk.emplace_back(cost, cap);
            }
        }
        return result;
    }
};

// Time:  O(nlogn)
// Space: O(n)
// sort, binary search
class Solution3 {
public:
    int maxCapacity(vector<int>& costs, vector<int>& capacity, int budget) {
        vector<int> idxs(size(costs));
        iota(begin(idxs), end(idxs), 0);
        sort(begin(idxs), end(idxs), [&](const auto& a, const auto& b) {
            return costs[a] < costs[b];
        });

        vector<int> prefix(size(capacity) + 1);
        for (int i = 0; i < size(capacity); ++i) {
            prefix[i + 1] = max(prefix[i], capacity[idxs[i]]);
        }
        int result = 0;
        vector<pair<int, int>> stk;
        vector<int> sorted_costs;
        sorted_costs.reserve(size(costs));
        for (const auto& i : idxs) {
            sorted_costs.emplace_back(costs[i]);
        }
        for (int i = 0; i < size(idxs); ++i) {
            const auto& cost = costs[idxs[i]], &cap = capacity[idxs[i]];
            if (cost >= budget) {
                break;
            }
            const auto& j = distance(cbegin(sorted_costs), lower_bound(cbegin(sorted_costs), cbegin(sorted_costs) + i, budget - cost)) - 1;
            result = max(result, prefix[j + 1] + cap);
        }
        return result;
    }
};

// Time:  O(nlogn)
// Space: O(n)
// sort, binary search
class Solution4 {
public:
    int maxCapacity(vector<int>& costs, vector<int>& capacity, int budget) {
        const auto& binary_search_right = [](int left, int right, const auto& check) {
            while (left <= right) {
                const auto& mid = left + (right - left) / 2;
                if (!check(mid)) {
                    right = mid - 1;
                } else {
                    left = mid + 1;
                }
            }
            return right;
        };

        vector<int> idxs(size(costs));
        iota(begin(idxs), end(idxs), 0);
        sort(begin(idxs), end(idxs), [&](const auto& a, const auto& b) {
            return costs[a] < costs[b];
        });

        vector<int> prefix(size(capacity) + 1);
        for (int i = 0; i < size(capacity); ++i) {
            prefix[i + 1] = max(prefix[i], capacity[idxs[i]]);
        }
        int result = 0;
        vector<pair<int, int>> stk;
        for (int i = 0; i < size(idxs); ++i) {
            const auto& cost = costs[idxs[i]], &cap = capacity[idxs[i]];
            if (cost >= budget) {
                break;
            }
            const auto& j = binary_search_right(0, i - 1, [&](const auto& x) {
                return costs[idxs[x]] + cost < budget;
            });
            result = max(result, prefix[j + 1] + cap);
        }
        return result;
    }
};

Beginner Explanation

What is Maximum Capacity Within Budget?

Maximum Capacity Within Budget (LeetCode #3814) is a Medium problem that primarily trains array.

How to think about it

Restate the goal in your own words before coding.
Work a tiny example by hand so the invariant becomes obvious.
Identify the pattern — this problem aligns with hash map, prefix sum, sort, stack, and binary search.
Only then translate the idea into code.

Why this problem matters

It sits in the sweet spot of interview difficulty: multiple valid approaches, clear trade-offs. Official solution notes mention: Hash Table, Prefix Sum, Sort, Mono Stack.

AlgoForge explanations are original teaching notes. Always open the official problem statement on LeetCode for constraints and examples.

Interview Walkthrough

Interview approach for Maximum Capacity Within Budget

Opening (30–60 seconds)

Clarify inputs/outputs and edge cases (empty input, single element, duplicates, overflow).
State a brute force so the interviewer knows you can solve it naively.
Propose the optimal direction tied to hash map, prefix sum, sort, stack, and binary search.

Core solution narrative

Define the state you track (pointers, DP cell, set membership, stack top, etc.).
Explain the transition when you process the next element.
Call out time (O(n + b)) and space (O(b)) before coding.
Code cleanly; narrate variable names.

What interviewers listen for

Correctness on edge cases
Complexity honesty
Ability to discuss trade-offs (e.g., hash map space vs. sort + two pointers)

Follow-up questions they may ask

Can you solve it with less memory?
What if the input stream is infinite / doesn't fit in RAM?
How would tests look for adversarial inputs?

Optimized Approach

Optimized solution notes

The reference solutions on AlgoForge target O(n + b) time and O(b) space.

Pattern focus: hash map, prefix sum, sort, stack, and binary search

Use the pattern as a checklist:

hash map — confirm the invariant holds after each step
prefix sum — confirm the invariant holds after each step
sort — confirm the invariant holds after each step
stack — confirm the invariant holds after each step
binary search — confirm the invariant holds after each step

Multiple methods appear in the source solutions — compare them and explain when each is preferable.

Implementation tips

Prefer readable names over micro-optimizations in interviews.
Extract helpers only when they clarify (e.g., expand-around-center, DFS visit).
After AC-level logic, re-scan for off-by-one and null checks.

Complexity Analysis

Complexity

Measure	Bound
Time	O(n + b)
Space	O(b)

How to justify this in an interview

Time: count loops, map/set operations, and recursive branching; state average vs worst case if relevant.
Space: include hash maps, recursion stack, and output allocation when the problem asks for it.

If your implementation differs from the reference, re-derive big-O from your code — never memorize a complexity you cannot defend.

Common Mistakes

Common mistakes on Maximum Capacity Within Budget

Skipping edge cases — empty collections, single-element inputs, max constraints.
Wrong invariant for hash map, prefix sum, sort, stack, and binary search — updating state too early or too late.
Mutating input unexpectedly when the problem forbids it.
Off-by-one in windows, ranges, or binary search bounds.
Ignoring overflow / precision for integer arithmetic problems.
Overengineering — jumping to an advanced structure when a simpler approach works.

Alternative Approaches

Alternatives

The source file includes more than one method. Compare:

Primary optimized path — best complexity for typical interviews.
Secondary approach — often brute force, sorting-based, or space-optimized variant.

Practice articulating when you would pick each (constraints, readability, follow-ups).

Edge Cases

Edge cases checklist

Minimum input size
Maximum input size / time limits
Duplicates and already-sorted input
Negative numbers / zeros (if applicable)
Disconnected structures (graphs/trees)
Single path vs branching recursion depth

Pattern Recognition

Spotting this pattern

Signal phrases that point to hash map, prefix sum, sort, stack, and binary search:

Sorted input or ability to sort without changing the answer class
Need for contiguous subarray / substring → consider sliding window
Need for O(1) membership → hash set/map
Optimal substructure + overlapping subproblems → DP
Connectivity / components → graph DFS/BFS or Union-Find

Primary topics: array.

Follow-up Interview Questions

Follow-ups

How does the solution change if the input is a stream?
Can you solve it in-place?
What if duplicates must be handled differently?
How would you parallelize the approach?
Design tests that would break a buggy implementation.

Practice Recommendations

What to practice next

Re-solve Maximum Capacity Within Budget in a second language (cpp, python).
Drill 3–5 more problems tagged array.
Teach the solution out loud in under 5 minutes.
Add this problem to your revision calendar in 3 days and 14 days.

Visualization

Conceptual diagram for Maximum Capacity Within Budget: show input structure (array), highlight the moving parts of the hash map, prefix sum, sort, stack, and binary search approach, and annotate each step with the maintained invariant and complexity.

Study checklist

Read the official problem statement on LeetCode
Solve on paper / whiteboard first
Implement the hash map, prefix sum, sort, stack, and binary search approach
Verify edge cases from the checklist
State time and space complexity aloud
Compare with the AlgoForge reference solution
Schedule a revision session

Revision notes

Maximum Capacity Within Budget (#3814) — Medium. Pattern: hash map, prefix sum, sort, stack, and binary search. Complexity: O(n + b) time / O(b) space. Re-derive the invariant before coding.

FAQs

What is the time complexity of Maximum Capacity Within Budget?+

The reference solutions aim for O(n + b) time and O(b) space. Always re-derive complexity from the code you write in the interview.

What pattern does Maximum Capacity Within Budget use?+

It primarily maps to hash map, prefix sum, sort, stack, and binary search, within the broader topic of array.

Is Maximum Capacity Within Budget good for interviews?+

Yes — as a Medium problem it is a solid practice target. Pair it with related problems in the same pattern family for spaced repetition.

Where can I read the official statement?+

Open the official LeetCode page for constraints and examples: https://leetcode.com/problems/maximum-capacity-within-budget/

#	Title	Difficulty	Topics
1906	Minimum Absolute Difference Queries	Medium	array
2271	Maximum White Tiles Covered by a Carpet	Medium	array
3380	Maximum Area Rectangle With Point Constraints I	Medium	array
3719	Longest Balanced Subarray I	Medium	array
3382	Maximum Area Rectangle With Point Constraints II	Hard	array
3721	Longest Balanced Subarray II	Hard	array
3762	Minimum Operations to Equalize Subarrays	Hard	array
1329	Sort the Matrix Diagonally	Medium	array