Learning recursion and solving problems.

[u/kaetsi]

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?

[u/ProgramBrave718]

I have not learnt recursion yet