add new files and prod variant's and change 347 problem

Author: Ashwagandha-coder

app/src/main/java/com/leetcode_kotlin/AlgorithmLeetcode.kt

@@ -2612,31 +2612,6 @@ fun findRelativeRanks(score: IntArray): Array<String> {
     return ans
 }
 
-/**
- * 347. Top K Frequent Elements
- */
-
-fun topKFrequent(nums: IntArray, k: Int): IntArray? {
-    val map: MutableMap<Int, Int> = HashMap()
-    for (n in nums) {
-        map[n] = map.getOrDefault(n, 0) + 1
-    }
-
-    val heap = PriorityQueue { a: Map.Entry<Int, Int>, b: Map.Entry<Int, Int> ->
-        b.value.compareTo(a.value)
-    }
-
-    for (entry in map.entries) {
-        heap.offer(entry)
-    }
-
-    val res = IntArray(k)
-    for (i in 0 until k) {
-        res[i] = heap.poll().key
-    }
-
-    return res
-}
 
 /**
  * 437. Path Sum III

contest/src/main/java/com/github/contest/priorityqueue/PriorityQueueLeetcode.kt

@@ -0,0 +1,29 @@
+package com.github.contest.priorityqueue
+
+import java.util.PriorityQueue
+
+/**
+ * 347. Top K Frequent Elements
+ */
+
+fun topKFrequent(nums: IntArray, k: Int): IntArray? {
+    val map: MutableMap<Int, Int> = HashMap()
+    for (n in nums) {
+        map[n] = map.getOrDefault(n, 0) + 1
+    }
+
+    val heap = PriorityQueue { a: Map.Entry<Int, Int>, b: Map.Entry<Int, Int> ->
+        b.value.compareTo(a.value)
+    }
+
+    for (entry in map.entries) {
+        heap.offer(entry)
+    }
+
+    val res = IntArray(k)
+    for (i in 0 until k) {
+        res[i] = heap.poll().key
+    }
+
+    return res
+}

contest/src/main/java/com/github/contest/priorityqueue/PriorityQueueProdVariant.kt

@@ -0,0 +1,18 @@
+package com.github.contest.priorityqueue
+
+/**
+ * 347. Top K Frequent Elements
+ */
+
+fun topKFrequentProdVariant(nums: IntArray, k: Int): IntArray {
+    val freq = mutableMapOf<Int, Int>()
+    val repeated = Array<MutableList<Int>>(nums.size + 1) {mutableListOf()}
+
+    for (num in nums) freq[num] = freq.getOrDefault(num, 0) + 1
+
+    for ((num, count) in freq) {
+        repeated[count].add(num)
+    }
+
+    return repeated.flatMap {it}.takeLast(k).toIntArray()
+}