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

varunu28 · web-flow · commit 6735f7a0d2bb · 2024-12-23T06:41:01.000+05:30
diff --git a/Easy/Minimum Number of Operations to Make Elements in Array Distinct.java b/Easy/Minimum Number of Operations to Make Elements in Array Distinct.java
@@ -0,0 +1,18 @@
+class Solution {
+    public int minimumOperations(int[] nums) {
+        Set<Integer> set = new HashSet<>();
+        int index = -1;
+        for (int i = nums.length - 1; i >= 0; i--) {
+            if (set.contains(nums[i])) {
+                index = i;
+                break;
+            }
+            set.add(nums[i]);
+        }
+        if (index == -1) {
+            return 0;
+        }
+        index++;
+        return index % 3 == 0 ? index / 3 : (index / 3) + 1;
+    }
+}
