From 7ad5cef4c8161664a523cad83d3925b85320a27c Mon Sep 17 00:00:00 2001
From: kotitechy <106464507+kotitechy@users.noreply.github.com>
Date: Thu, 23 Jan 2025 06:51:59 +0530
Subject: [PATCH] Create 26. Remove Duplicates from Sorted Arrayl

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums.

Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:

    Change the array nums such that the first k elements of nums contain the unique elements in the order they were present in nums initially. The remaining elements of nums are not important as well as the size of nums.
    Return k.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.



Example 1:

Input: nums = [1,1,2]
Output: 2, nums = [1,2,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).

Example 2:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).



Constraints:

    1 <= nums.length <= 3 * 104
    -100 <= nums[i] <= 100
    nums is sorted in non-decreasing order.
---
 26. Remove Duplicates from Sorted Arrayl | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)
 create mode 100644 26. Remove Duplicates from Sorted Arrayl

diff --git a/26. Remove Duplicates from Sorted Arrayl b/26. Remove Duplicates from Sorted Arrayl
new file mode 100644
index 0000000000000..65e344a5bda18
--- /dev/null
+++ b/26. Remove Duplicates from Sorted Arrayl	
@@ -0,0 +1,18 @@
+class Solution:
+    def removeDuplicates(self, nums: List[int]) -> int:
+        # d=[]
+        # seen=set()
+        # for i in nums:
+        #     if(i in seen):
+        #         d.append(i)
+        #     seen.add(i)
+        # nums[:]=seen
+
+        seen=set()
+        index=0
+        for i in nums:
+            if i not in seen:
+                seen.add(i)
+                nums[index]=i
+                index+=1
+        return index