diff --git a/CPP/README.md b/CPP/README.md
index 43ed59a..5271074 100644
--- a/CPP/README.md
+++ b/CPP/README.md
@@ -72,3 +72,5 @@ Format: -[Program name](name of the file)
 [N-Queens Proplem](N-QueensProblem.cpp)
 
 [Topological Sorting](Topological_sorting.cpp)
+
+[Climbing stairs with min moves](climb_stairs_with_min_moves.cpp)
diff --git a/CPP/climb_stairs_with_min_moves.cpp b/CPP/climb_stairs_with_min_moves.cpp
new file mode 100644
index 0000000..0382519
--- /dev/null
+++ b/CPP/climb_stairs_with_min_moves.cpp
@@ -0,0 +1,49 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    
+    int n;
+    cout<<"Enter the number of stairs:"<<endl;
+    cin>>n;  // number of stairs
+    int jumps[n+1]={0};
+
+    cout<<"Enter the jumps at each stairs"<<endl;
+    for(int i=0;i<n;i++)
+      cin>>jumps[i];
+    queue<int>q;
+    for(int i=0;i<n;i++)
+      q.push(i);
+
+    int dp[n];
+    int x=q.front();
+     dp[0]=0;
+    for(int i=1;i<n;)
+    {
+        
+        if(i<=jumps[x]+x)   //checking the condition
+            dp[i]=dp[x]+1,i++;
+        else
+        {
+            x=q.front();
+            q.pop();
+            
+        }
+    } 
+    cout<<dp[n-1];  //printing min jumps required to reach last stairs.
+}
+
+/*
+ Input : number of stairs, jumps at every stairs
+ Output: minimum jumps to reach last stairs.
+ 
+
+ Sample input : 
+            5
+            [2,3,1,1,4]
+
+ Output : 2
+       
+
+*/
\ No newline at end of file
diff --git a/CPP/climb_strairs_with_min_moves.exe b/CPP/climb_strairs_with_min_moves.exe
new file mode 100644
index 0000000..3403cde
Binary files /dev/null and b/CPP/climb_strairs_with_min_moves.exe differ