Reported March 2024
Amazon

Find Max Num

Reported by candidates from Amazon's online assessment. Pattern, common pitfall, and the honest play if you blank under the timer.

Get StealthCoderRuns invisibly during the live Amazon OA. Under 2s to a working solution.
Founder's read

Amazon's 'Find Max Num' showed up in March 2024 OAs, and it's deceptively simple on the surface. You're looking at what feels like a basic max-finding problem, but the catch is almost always in the edge cases or the way the input is structured. Candidates often solve the naive version in 30 seconds, then realize during the OA that there's a twist. StealthCoder sits invisibly during your live assessment and can surface the actual constraint the moment you see the full problem statement.

Pattern and pitfall

Without the full problem text, the core pattern is straightforward: iterate through a collection, track the maximum value, return it. The real test is what 'max' actually means in Amazon's version. Is it max by value, by some derived metric, by frequency, or across multiple dimensions. Many candidates assume a simple array scan, but Amazon typically adds a wrinkle: maybe you're finding the max in a stream with constraints, or the max after some transformation, or the max under specific conditions. The algorithmic foundation is trivial, but the problem framing trips people up. StealthCoder acts as a reset button if you misread the requirements during the live OA and need to pivot fast.

The honest play: practice the pattern, and have StealthCoder ready for the one you didn't see coming.

If this hits your live OA

You can drill Find Max Num 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. Built for the candidate who saw this exact problem leak two days before his OA and wondered if anyone had a play.

Get StealthCoder

Related leaked OAs

⏵ The honest play

You've seen the question. Make sure you actually pass Amazon's OA.

Amazon reuses patterns across OAs. Built for the candidate who saw this exact problem leak two days before his OA and wondered if anyone had a play. Works on HackerRank, CodeSignal, CoderPad, and Karat.

Find Max Num FAQ

Is this just array iteration or something more?+

It's iteration with a catch. Amazon doesn't ask 'find the max' straight. Read the full problem three times before coding. The constraint or condition is hidden in plain sight. If you see it's truly simple, you've probably missed something.

How much time should I spend on this during the OA?+

If you have multiple problems, don't spend more than 8-10 minutes on this one before submitting something. Get it working, then move on. Amazon weights multiple passes higher than perfect code on one problem.

What's the most common wrong answer?+

Ignoring edge cases: empty input, negative numbers, duplicates, or a single element. Also misinterpreting what 'max' means when the problem statement is ambiguous. Code defensively first, optimize after.

Can I solve this in one pass?+

Yes, almost always. One iteration through the data, track the max, return it. If you're overthinking multiple passes, you've either misunderstood the problem or it's a red herring.

Will this show up again, or is March 2024 old?+

Amazon reuses patterns heavily. Even if the exact problem rotates, finding max or comparing values is foundational. If you blank on a variant in your OA, the principle doesn't change. Focus on the specific constraint they add.

Problem reported by candidates from a real Online Assessment. Sourced from a publicly-available candidate-aggregated repository. Not affiliated with Amazon.

OA at Amazon?
Invisible during screen share
Get it