Question

simran is running up a staircase with n steps and can hop(jump) either 1 step 2 steps or 3 steps at a time.you have to count how many possible ways simran can run up to the stairs.

Answer 1

There are n stairs; a man remaining at the base needs to achieve the best. The individual can climb either 1 stair or 2 stairs at once.

Tally the quantity of ways, the individual can achieve the best. The estimation of n is 3. There are 3 different ways to achieve the best.

The outline is taken from Easier Fibonacci perplexes.