add 3396

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.strings.freqAlphabets
+import com.github.contest.hashTable.minimumOperations
 import java.util.TreeMap
 
 
@@ -11,7 +11,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    freqAlphabets("12345678910#11#12#13#14#15#16#17#18#19#20#21#22#23#24#25#26#").also { println(it) }
+    minimumOperations(intArrayOf(1, 2, 3, 4, 2, 3, 3, 5, 7)).also { println(it) }
 }
 
 fun testing() {

contest/src/main/java/com/github/contest/hashTable/HashTableLeetcode.kt

@@ -271,4 +271,45 @@ fun repeatedCharacter(s: String): Char {
     }
 
     return 'a'
+}
+
+/**
+ * 3396. Minimum Number of Operations to Make Elements in Array Distinct
+ */
+
+fun minimumOperations(nums: IntArray): Int {
+    val map = mutableMapOf<Int, Int>()
+    var operations = 0
+
+    for (num in nums) map[num] = map.getOrDefault(num, 0) + 1
+
+    if (map.size == nums.size) return 0
+
+    for (i in nums.indices step 3) {
+        if (i + 2 < nums.size) {
+            val one = nums[i]
+            val two = nums[i + 1]
+            val three = nums[i + 2]
+            map.reduceOrRemove(one)
+            map.reduceOrRemove(two)
+            map.reduceOrRemove(three)
+            var isUnique = true
+            for (value in map.values) {
+                if (value > 1) {
+                    isUnique = false
+                    break
+                }
+            }
+            if (isUnique) return operations + 1
+            operations++
+        }
+    }
+
+    return if (map.size > 0) operations + 1 else operations
+
+}
+
+private fun MutableMap<Int, Int>.reduceOrRemove(key: Int) {
+    this[key] = this.getOrDefault(key, 0) - 1
+    if (this.getOrDefault(key, 0) == 0) this.remove(key)
 }