Coding: Staircase Fibonacci | Dataford Interview Questions

How would you compute the number of ways to reach the n-th step when you can jump 1 or 2 steps?

Implement the function below. A path is an ordered sequence of jumps, so jumping 1 then 2 differs from jumping 2 then 1. Define n = 0 as one valid way: taking no jumps.

Input and Output

n is a nonnegative integer. Return the exact number of distinct ways to reach step n.

Function signature: count_ways(n)

Constraints

0 <= n <= 1000
Each jump must be either 1 step or 2 steps
Return the exact integer count

Function Signature

def count_ways(n):

Your question is Coding: Staircase Fibonacci. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem