โ† Amazon questions

Count ways to reach nth stairs and modified DFS

Filed under Amazon

Find the number of ways to reach the nth stair where you can take either 1 or 2 steps at a time. Additionally, solve a related graph traversal problem using a modified Depth First Search (DFS).

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.