Counting Step

CodeChefOpen on judge ↗

A Dog is running up a staircase with $N$ steps. It can hop either $1$ step, $2$ steps or $3$ steps at a time. Implement a method to count how many possible ways the dog can run up to the stairs. You need to return all possible number of ways. ###Input: -Integer $N$ (No. of steps) ###Output: Print the possible number of ways. ###Constraints - $N \leq 30$ ###Sample Input: 5

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI