Sync LeetCode submission Runtime - 7 ms (100.00%), Memory - 17.6 MB (100.00%)

Author: jimit105

3656-minimum-number-of-operations-to-make-elements-in-array-distinct/README.md

@@ -0,0 +1,62 @@
+<p>You are given an integer array <code>nums</code>. You need to ensure that the elements in the array are <strong>distinct</strong>. To achieve this, you can perform the following operation any number of times:</p>
+
+<ul>
+	<li>Remove 3 elements from the beginning of the array. If the array has fewer than 3 elements, remove all remaining elements.</li>
+</ul>
+
+<p><strong>Note</strong> that an empty array is considered to have distinct elements. Return the <strong>minimum</strong> number of operations needed to make the elements in the array distinct.<!-- notionvc: 210ee4f2-90af-4cdf-8dbc-96d1fa8f67c7 --></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,2,3,4,2,3,3,5,7]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>In the first operation, the first 3 elements are removed, resulting in the array <code>[4, 2, 3, 3, 5, 7]</code>.</li>
+	<li>In the second operation, the next 3 elements are removed, resulting in the array <code>[3, 5, 7]</code>, which has distinct elements.</li>
+</ul>
+
+<p>Therefore, the answer is 2.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [4,5,6,4,4]</span></p>
+
+<p><strong>Output:</strong> 2</p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>In the first operation, the first 3 elements are removed, resulting in the array <code>[4, 4]</code>.</li>
+	<li>In the second operation, all remaining elements are removed, resulting in an empty array.</li>
+</ul>
+
+<p>Therefore, the answer is 2.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [6,7,8,9]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The array already contains distinct elements. Therefore, the answer is 0.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

3656-minimum-number-of-operations-to-make-elements-in-array-distinct/solution.py

@@ -0,0 +1,13 @@
+# Time: O(n^2)
+# Space: O(n)
+
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+        count = 0
+
+        while len(set(nums)) != len(nums):
+            nums = nums[3: ]
+            count += 1
+
+        return count
+