diff --git a/Leetcode/Min_Cost_Climbing_Stairs.cpp b/Leetcode/Min_Cost_Climbing_Stairs.cpp
new file mode 100644
index 0000000..c7ffc5b
--- /dev/null
+++ b/Leetcode/Min_Cost_Climbing_Stairs.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int minCostClimbingStairs(vector<int>& cost) {
+        int n=cost.size();
+        int dp[n];
+        dp[0]=cost[0];
+        dp[1]=cost[1];
+        for(int i=2;i<n;i++){
+            dp[i]=min(dp[i-1],dp[i-2])+cost[i];
+        }
+        return min(dp[n-1],dp[n-2]);
+    }
+};