Neeraj & Stair

CodeChefOpen on judge ↗

Neeraj is a very curious boy. One day he was at home, climbing stairs. Suddenly a thought comes to his mind that in how many ways can I reach the $N$-th Stair if I am currently at the ground. Neeraj can climb at max two stairs in one step. In other words, he can only climb either one stair up or two stairs up in one step. He is very smart so he quickly found the answer. Now it's your turn to fin

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