Add solution #3396

Author: JoshCrozier

README.md

@@ -361,6 +361,7 @@
 2490|[Circular Sentence](./2490-circular-sentence.js)|Easy|
 2529|[Maximum Count of Positive Integer and Negative Integer](./2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
+3396|[Minimum Number of Operations to Make Elements in Array Distinct](./3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
 3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|
 
 ## License

solutions/3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js

@@ -0,0 +1,29 @@
+/**
+ * 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/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minimumOperations = function(nums) {
+  const unique = new Set();
+
+  for (let i = nums.length - 1; i > -1; i--) {
+    if (unique.has(nums[i])) {
+      return Math.ceil((i + 1) / 3);
+    }
+    unique.add(nums[i]);
+  }
+
+  return 0;
+};