problem : You are climbing a staircase. It takes n
steps to reach the top.
Each time you can either climb 1
or 2
steps. In how many distinct ways can you climb to the top?
Q.here i am not understanding why these problem is following fibonacci series??