← Amazon questions

Staircase step counting and k largest numbers in running stream

Filed under Amazon

Part 1: Calculate the number of ways to reach the top of an n-step staircase taking 1 or 2 steps at a time. Part 2: Maintain the k largest numbers from a continuous stream of incoming integers.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.