diff --git a/Problems/LeetcodeProblems/26-remove-duplicates-from-sorted-array.h b/Problems/LeetcodeProblems/26-remove-duplicates-from-sorted-array.h
index e69de29..2ce7bb6 100644
--- a/Problems/LeetcodeProblems/26-remove-duplicates-from-sorted-array.h
+++ b/Problems/LeetcodeProblems/26-remove-duplicates-from-sorted-array.h
@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int removeDuplicates(vector<int>& nums) {
+        int n = nums.size(), pos = 0;
+        if(n <= 1) 
+            return n;
+        for(int i = 0; i < n-1; ++i) {
+            if(nums[i] != nums[i+1]) {
+                nums[++pos] = nums[i+1];
+            }
+        }
+        return pos+1;
+    }
+};
\ No newline at end of file