# Javascript Staircase Problem

**You are climbing a stair case.**

**Javascript staircase problem**.
Since every line is nearly the same and only one character changes at a time you should take advantage of that and use an array as a buffer.
There exists a staircase with n steps and you can climb up either 1 or 2 steps at a time.
The decoder will operate over these blocks shift out a decoded block and shift in a newly received block.
Generalization of the problem how to count the number of ways if the person can climb up to m stairs for a given value m.

Each time you can either climb 1 or 2 steps. Of hashes in last line is equal to the height of staircase. You are climbing a stair case. Staircase problem statement consider a staircase of size n 4.

Given n write a function that returns the number of unique ways you can climb the staircase. It takes n steps to reach to the top. If the value of n is less than 0 then return 0 and if the value of n is equal to zero then return 1 as it is the starting stair. For example if m is 4 the person can climb 1 stair or 2 stairs or 3 stairs or 4 stairs at a time.

Let s work through the following problem. Given n will be a positive integer. Observe that its base and height are both equal to n and the image is drawn using symbols and spaces. Input n as the height of the staircase draw a staircase with the given height.

Such a decoder is referred to as a sliding window decoder. Staircase codes are decoded by using an iterative decoder operating over several received blocks. Call the function recursively with values n 1 n 2 and n 3 and sum up the values that are returned i e. Consider the above figure to be a set of 7 received blocks of bits from the bsc.

Sum count n 1 count n 2 count n 3 return the value of the sum. It takes n steps to reach to the top. Javascript function names should start with a lowercase character and staircase is one compound word in english. Today s algorithm is the climbing stairs problem.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top. Please read our cookie policy for more information about how we use cookies. Before coding analysis of input and output.

For the generalization of above approach the following recursive relation can be used. Print a right aligned staircase with n steps. We use cookies to ensure you have the best browsing experience on our website. A common algorithm found in technical interviews is the climbing staircase problem.