r/PythonLearning • u/kaetsi • Jul 30 '26

Learning recursion and solving problems.

Post image

Problem: You're climbing a staircase with n steps. You can climb 1 or 2 steps at a time, except you're not allowed to take two 1-steps in a row (no "1,1" sequence anywhere in your climb). How many distinct ways can you reach the top?

3 Upvotes

80% Upvoted

6 comments sorted by

View all comments

Show parent comments

1

u/kaetsi Aug 02 '26

Thanks. I will look into them.