https://leetcode.com/contest/weekly-contest-237

python/1832-check-if-the-sentence-is-pangram.py

@@ -0,0 +1,4 @@
+class Solution:
+    def checkIfPangram(self, sentence: str) -> bool:
+
+        return len(set(sentence)) == 26

python/1833-maximum-ice-cream-bars.py

@@ -0,0 +1,16 @@
+class Solution:
+    def maxIceCream(self, costs: List[int], coins: int) -> int:
+        costs.sort()
+
+        balance = coins
+
+        n = 0
+
+        for c in costs:
+            if balance >= c:
+                n += 1
+                balance -= c
+            else:
+                break
+
+        return n

python/1834-single-threaded-cpu.py

@@ -0,0 +1,37 @@
+import heapq
+
+
+class Solution:
+    def getOrder(self, tasks: List[List[int]]) -> List[int]:
+
+        # (t, duration, i)
+        events = []
+
+        # (duration, i)
+        pending = []
+
+        logs = []
+
+        for (i, task) in enumerate(tasks):
+            heapq.heappush(events, [task[0], task[1], i])
+
+        # print(events)
+
+        e = heapq.heappop(events)
+        logs.append(e[2])
+        events.append([e[0] + e[1], float('inf')])
+
+        while len(events) > 0:
+            e = heapq.heappop(events)
+            # print(e)
+            if e[1] == float('inf'):  # a process ended
+                if len(pending) == 0:
+                    break
+
+                new_task = heapq.heappop(pending)
+                heapq.heappush(events, [new_task[0] + e[0], float('inf')])
+                logs.append(new_task[1])
+            else:  # add process to q
+                heapq.heappush(pending, [e[1], e[2]])
+
+        return logs

python/1835-find-xor-sum-of-all-pairs-bitwise-and.py

@@ -0,0 +1,12 @@
+class Solution:
+    def getXORSum(self, arr1: List[int], arr2: List[int]) -> int:
+
+        ca = 0
+        for a in arr1:
+            ca = ca ^ a
+
+        cb = 0
+        for b in arr2:
+            cb = cb ^ b
+
+        return ca & cb