Getting Late

CodeChefOpen on judge ↗

Gopal is Late for School . He Managed to Reach the School Somehow . He is Standing on the Ground floor, To reach his classroom he has to climb N stairs . Gopal is already tired , he can only climb $1$ , $2$ or $3$ Stairs at each step . Gopal suddenly got curious to know the total number of ways to reach the $N$-th Stair if he can climb $1$ , $2$ or $3$ stairs at each step . Gopal is not good in so

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