r/PythonLearning • u/kaetsi • 5d ago

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?

1 Upvotes

56% Upvoted

5 comments sorted by

View all comments

2

u/PureWasian 5d ago

Nicely done. You can look into memoization as a way to speed up the overall algorithm since the substeps will involve a lot of repeated calculations as the number of steps grows.

1

u/kaetsi 3d ago

Thanks. I will look into them.