diff --git a/algorithms/CPlusPlus/Arrays/remove-duplicates.cpp b/algorithms/CPlusPlus/Arrays/remove-duplicates.cpp
new file mode 100644
index 00000000..34b6720d
--- /dev/null
+++ b/algorithms/CPlusPlus/Arrays/remove-duplicates.cpp
@@ -0,0 +1,64 @@
+/*CPP program to remove the duplicate elements from the array in place
+  without using any extra space.
+  
+  The time complexity of the algorithm is: O(n)
+Sample Example:
+Input array size: 6
+Input array: 1 1 2 3 4 4
+output : 1 2 3 4
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// method to remove duplicate elements from array
+void removeDuplicates(int arr[],int size){
+	 
+int newsize=size; // variable to keep the track of size of array.
+
+for(int i=0,j=i+1;j<size;j++){
+
+     if(arr[i]==arr[j]){
+            newsize--;
+        }else{
+               i++;
+    	       arr[i]=arr[j];
+              }
+
+        }
+  // displaying the array after removing the duplicate elements.
+    cout<<"The Array after removing duplicate elements are:"<<endl;
+        for(int i=0;i<newsize;i++){
+               cout<<arr[i]<<endl;
+            }
+
+   }
+
+
+// driver program to test above methods
+int main(){
+	// get the size of the array
+   int size;
+   cout<<"Enter the size of the array"<<endl;
+   cin>>size;
+   // declare the array
+   int arr[size];
+  // storing the minimum integer value for checking of array is sorted or not
+int max=-2147483647;
+
+   // get the  sorted array from the user
+   cout<<"Enter the sorted array"<<endl;
+ 
+   for(int i=0;i<size;i++){
+   	cin>>arr[i];
+   	// checking if input array is sorted or not
+   	if(arr[i]<max){
+   		cout<<"Array not sorted";
+   		return 0;
+	   }else{
+	   	max=arr[i];
+	   }
+   }
+    removeDuplicates(arr,size);
+
+}
diff --git a/algorithms/CPlusPlus/README.md b/algorithms/CPlusPlus/README.md
index 838da1ac..fdeb88cd 100644
--- a/algorithms/CPlusPlus/README.md
+++ b/algorithms/CPlusPlus/README.md
@@ -12,6 +12,7 @@
 8. [Sorted-Rotated Search Array](Arrays/search-sorted-rotated.cpp)
 9. [Fractional Knapsack](Arrays/fractional-knapsack.cpp)
 10. [Quick Selection](Arrays/quick-select.cpp)
+11. [Remove Duplicates](Arrays/remove-duplicates.cpp)
 
 ## Dynamic-Programming