Add Find the number of ways to reach the K-th Stair

[Akash2023IT]

Hey,
This is a hard Leetcode Problem which uses a concept of memoization in recursion . Here is the question :
https://leetcode.com/problems/find-number-of-ways-to-reach-the-k-th-stair/description

You are given a non-negative integer k. There exists a staircase with an infinite number of stairs, with the lowest stair numbered 0.

Alice has an integer jump, with an initial value of 0. She starts on stair 1 and wants to reach stair k using any number of operations. If she is on stair i, in one operation she can:

Go down to stair i - 1. This operation cannot be used consecutively or on stair 0.
Go up to stair i + 2jump. And then, jump becomes jump + 1.
Return the total number of ways Alice can reach stair k.

Note that it is possible that Alice reaches the stair k, and performs some operations to reach the stair k again.

Please assign this to me @harsh-dart

[Akash2023IT]

@harsh-dart pls add the hactoberfest labels

[aryaman0406]

Hi @harsh-dart please assign me this task.

[Blacksujit]

/assign

[Blacksujit]

Link to the PR #109