You are climbing a stair case.
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.