โ† OYO questions

Minimum steps to reach level N

Filed under OYO

Find the number of distinct ways to reach level N, where you can take either 1 or 2 steps at a time. This is equivalent to the Fibonacci sequence.

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 OYO questions

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