Java Programming – Count ways to reach the n stair – Mathematical Algorithms – The time complexity of above solution is exponential.
climbing stairs problem
2 Articles
2
C Programming – Count ways to reach the n stair – Mathematical Algorithms – There are n stairs, a person standing at the bottom wants to reach the top.