diff --git a/C++/Algorithms/Dynamic Programming/kc.cpp b/C++/Algorithms/Dynamic Programming/kc.cpp
new file mode 100644
index 000000000..8edba485c
--- /dev/null
+++ b/C++/Algorithms/Dynamic Programming/kc.cpp	
@@ -0,0 +1,24 @@
+
+
+
+//  Name - 70
+//  Dificulty - Easy
+//  Problem number - 70
+//  Link -https://leetcode.com/problems/climbing-stairs/
+
+ class Solution {
+    public:
+        int solve(int n , vector<int> &dp)
+        {
+            if(n==0) return 0;
+            if(n==1) return 1;
+            if(n==2) return 2;
+            
+            if(dp[n]!=-1) return dp[n];
+            
+            return dp[n] = solve(n-1,dp) + solve(n-2,dp);
+        }
+        int climbStairs(int n) {
+            vector<int> dp(n+1,-1);
+            return solve(n,dp);
+        }
\ No newline at end of file