Merge pull request #137 from abhijeetaman007/master

Solution to DP problem Climbing Stairs added

Contributors.html

@@ -190,6 +190,8 @@ <h1 class="animated rubberBand delay-4s">Contributors</h1>
 <a class="box-item" href="https://github.com/siddharthdeo99"><span>Siddharth deo</span></a>
 <a class="box-item" href="https://github.com/Aniket6039"><span>Aniket Raj</span></a>
 <a class="box-item" href="https://github.com/JayantGoel001"><span>Jayant Goel</span></a>
+<a class="box-item" href="https://github.com/abhijeetaman007"><span>Abhijeet Sinha</span></a>
+
 
       </div>
     </div>

Program's_Contributed_By_Contributors/Dynamic Programming/ClimbingStairs.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+
+int climbStairs(int n)
+{
+    int dp[n + 2];
+    dp[0] = 0;
+    dp[1] = 1;
+    dp[2] = 2;
+    for (int i = 3; i <= n; i++)
+    {
+        dp[i] = dp[i - 1] + dp[i - 2];
+    }
+    return dp[n];
+}
+
+int main(int n)
+{
+    int n;
+    //Enter Number of Stairs
+    cin>>n;
+    int ans=climbStairs(n);
+    cout<<ans<<endl;
+}