i want a full code for finding different ways to climb the n-stair case problem that is each step is either 1 or 2 stairs.

Eg- a 3-stairs staircase can be climbed in 3 ways :1-1,1-2,2-1.

Using subset method can any one can help me out for this problem?