Create Minimum Number of Operations to Make Elements in Array Distinct.py

erjan · web-flow · commit 0153742ae207 · 2025-04-08T09:28:08.000+05:00
diff --git a/Minimum Number of Operations to Make Elements in Array Distinct.py b/Minimum Number of Operations to Make Elements in Array Distinct.py
@@ -0,0 +1,35 @@
+'''
+You are given an integer array nums. You need to ensure that the elements in the array are distinct. To achieve this, you can perform the following operation any number of times:
+
+Remove 3 elements from the beginning of the array. If the array has fewer than 3 elements, remove all remaining elements.
+Note that an empty array is considered to have distinct elements. Return the minimum number of operations needed to make the elements in the array distinct.
+'''
+#my solution
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+        n = len(nums)
+
+
+        res = 0
+
+        while len(set(nums))!= len(nums) :
+
+            if len(nums)>3:
+                nums = nums[3:]
+                res +=1
+            else:
+                res+=1
+                break
+        return res
+
+------------------------------------------------------------------
+#another solution
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+        count=0
+        while len(nums)>len(set(nums)):
+            nums=nums[3:]
+            count+=1
+        return count
+        
+        
