- Add: Weekly Contest 366

Author: BNSC1

LeetCode/2895. Minimum Processing Time.kt

@@ -0,0 +1,18 @@
+class Solution {
+    fun minProcessingTime(pTimes: List<Int>, tasks: List<Int>): Int {
+        var res = 0
+        val pTimes = pTimes.sorted()
+        val tasks = tasks.sortedDescending()
+        
+        var i = 0
+        pTimes.forEach { pTime ->
+            var total = 0
+            repeat(4) {
+                total = max(total, pTime + tasks[i])
+                i++
+            }
+            res = max(res, total)
+        }
+        return res
+    }
+}

LeetCode/2897. Apply Operations on Array to Maximize Sum of Squares.kt

@@ -0,0 +1,24 @@
+class Solution {
+    fun maxSum(nums: List<Int>, k: Int): Int {
+        val bits = IntArray(32)
+        val offset = 1000000007L
+        nums.forEach { num ->
+            repeat(32) { i ->
+                if (num and (1 shl i) != 0) bits[i]++
+            }
+        } //counting for each bit
+
+        var res = 0L
+        repeat(k) {
+            var cur = 0L
+            repeat(32) { i ->
+                if (bits[i] > 0) {
+                    bits[i]--
+                    cur = cur or (1 shl i).toLong()
+                }
+            } //pick all available bits
+            res = (res + cur * cur % offset) % offset
+        }
+        return res.toInt()
+    }
+}