Counting Strategies: Casework, Complementary & Overcounting · Hard problem

A staircase has $10$ steps. Climbing $1$ or $2$ steps at a time, in how many distinct sequences of moves can you reach the top?