Question: 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? (n is always a positive integer).
https://t.co/tAUy7del52
#coding#techtwitter#programming
This is one of those textbook problems. It is a classic expression of when LIFO behavior favors us when solving specific problems.
https://t.co/mV3SbErxaO
#techtwitter#coding#programming#code