2022 day 1

puzzles/Y2015/D5/p2.py

@@ -7,8 +7,8 @@ def puzzle(input: str) -> Any:
     for line in lines:
         first = False
         for i in range(len(line) - 3):
-            sub = line[i:i + 2]
-            if sub in line[i + 2:]:
+            sub = line[i : i + 2]
+            if sub in line[i + 2 :]:
                 first = True
                 break
         if not first:

puzzles/Y2022/D1/p1.py

@@ -0,0 +1,11 @@
+from typing import Any
+
+
+def puzzle(input: str) -> Any:
+    groupedCalories = input.strip().split("\n\n")
+    highest = 0
+    for group in groupedCalories:
+        total = sum(int(calorie) for calorie in group.split("\n"))
+        if total > highest:
+            highest = total
+    return highest

puzzles/Y2022/D1/p2.py

@@ -0,0 +1,13 @@
+import heapq
+from typing import Any
+
+
+def puzzle(input: str) -> Any:
+    groupedCalories = input.strip().split("\n\n")
+    elvesCalories = []
+    for group in groupedCalories:
+        elvesCalories.append(sum(int(calorie) for calorie in group.split("\n")))
+    # convert to negative to get 3 smallest using min heap
+    elvesCalories = [-calories for calories in elvesCalories]
+    heapq.heapify(elvesCalories)
+    return sum(heapq.heappop(elvesCalories) * -1 for _ in range(3))