Apr 08

Author: siddydutta

2025-04-April-LeetCoding-Challenge/Minimum Number of Operations to Make Elements in Array Distinct.py

@@ -0,0 +1,35 @@
+class Solution:
+    def minimumOperations(self, nums: list[int]) -> int:
+        frequencies, non_unique = dict(), set()
+        for num in nums:
+            if num in frequencies:
+                frequencies[num] += 1
+                non_unique.add(num)
+            else:
+                frequencies[num] = 1
+
+        operations = 0
+        while nums and non_unique:
+            operations += 1
+            for num in nums[:3]:
+                frequency = frequencies[num] - 1
+                if frequency == 1:
+                    non_unique.remove(num)
+                frequencies[num] = frequency
+            nums = nums[3:]
+        return operations
+
+
+def main():
+    nums = [1, 2, 3, 4, 2, 3, 3, 5, 7]
+    assert Solution().minimumOperations(nums) == 2
+
+    nums = [4, 5, 6, 4, 4]
+    assert Solution().minimumOperations(nums) == 2
+
+    nums = [6, 7, 8, 9]
+    assert Solution().minimumOperations(nums) == 0
+
+
+if __name__ == '__main__':
+    main()

2025-04-April-LeetCoding-Challenge/README.md

@@ -11,7 +11,7 @@
 | April 05 | [1863. Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/) | Easy | Solved |
 | April 06 | [368. Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | Medium | Unsolved |
 | April 07 | [416. Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) | Medium | Solved |
-| April 08 | []() |  |  |
+| April 08 | [3396. Minimum Number of Operations to Make Elements in Array Distinct](https://leetcode.com/problems/minimum-number-of-operations-to-make-elements-in-array-distinct/) | Easy | Solved |
 | April 09 | []() |  |  |
 | April 10 | []() |  |  |
 | April 11 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 2 | 2 | 0 |
+| Easy   | 3 | 3 | 0 |
 | Medium | 5 | 4 | 1 |
 | Hard   | 0 | 0 | 0 |