Get Max Throughput
Reported by candidates from Amazon's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.
Amazon's Get Max Throughput hit the OA queue in November 2024, and it's a graph or network flow problem disguised as a throughput optimization question. You're looking at a scenario where you need to find the maximum capacity or optimal routing through a system, which means either greedy selection, binary search on the answer, or actual max flow logic. The title alone tells you it's not a simple simulation. StealthCoder will surface the pattern fast if you freeze mid-interview.
Pattern and pitfall
Get Max Throughput typically hinges on either binary search combined with a feasibility check (can we achieve throughput X?) or a greedy approach where you iteratively pick the best path or resource. If it's a network flow variant, you're implementing Ford-Fulkerson or a similar flow algorithm. The common trap: candidates miss that you need to validate whether a given throughput is achievable before jumping to brute force. If the problem describes bottlenecks, edge capacities, or parallel routes, think max flow. If it's about selecting a subset of resources to maximize output, think greedy or DP. StealthCoder's real job here is catching which variant you're actually solving when the problem text is terse or ambiguous.
Memorize the pattern. If you can't, run StealthCoder. The proctor sees the IDE. They don't see what's behind it.
You can drill Get Max Throughput cold, or you can hedge it. StealthCoder runs invisibly during screen share and surfaces a working solution in under 2 seconds. The proctor sees the IDE. They don't see what's behind it. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge.
Get StealthCoderRelated leaked OAs
You've seen the question.
Make sure you actually pass Amazon's OA.
Amazon reuses patterns across OAs. Made by an engineer who treats the OA as theater. If yours is tonight, you don't have time to grind. You have time to hedge. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Get Max Throughput FAQ
Is this a max flow problem or a greedy pick?+
Without the full text it's hard to be certain, but 'throughput' + 'max' usually means either max flow (Dinic's, Ford-Fulkerson) or binary search on the answer with a feasibility check. Greedy alone rarely works for real throughput problems at Amazon's bar.
What's the most common mistake candidates make?+
Not recognizing the feasibility pattern. They jump to brute force instead of binary searching on the answer or modeling it as a flow network. If you see 'throughput' and 'bottleneck' in the same problem, it's a signal.
How do I prep for this in 24 hours if I'm rusty on max flow?+
Brush up on max flow basics and binary search on answer space. Practice one Ford-Fulkerson variant. Honestly, if flow is new, binary search + a simple feasibility check might be the intended approach. Focus on that pattern first.
Will I need to implement a complex flow algorithm from scratch?+
Probably yes, at least a working version. Amazon OAs often require it. Have a clean max flow template ready. Don't rely on library functions unless explicitly allowed.
Is this problem still showing up in November 2024 OAs?+
Yes, confirmed November 2024. It's a steady Amazon favorite. Throughput and optimization problems don't rotate out quickly. Treat it as a real threat.