2024: d19: ex2: add solution

2024/d02/ex1/ex1.py

@@ -11,8 +11,11 @@ def solve(input: list[str]) -> int:
         return [[int(n) for n in line.split()] for line in input]
 
     def is_safe(report: Report) -> bool:
-        def is_increasing_safe(report: Report) -> bool:
-            return all(1 <= (b - a) <= 3 for a, b in itertools.pairwise(report))
+        def is_increasing_safe(report: Report):
+            for a, b in itertools.pairwise(report):
+                if not 1 <= (b - a) <= 3:
+                    return False
+            return True
 
         return is_increasing_safe(report) or is_increasing_safe(report[::-1])
 

2024/d02/ex2/ex2.py

@@ -11,8 +11,11 @@ def solve(input: list[str]) -> int:
         return [[int(n) for n in line.split()] for line in input]
 
     def is_safe(report: Report) -> bool:
-        def is_increasing_safe(report: Report) -> bool:
-            return all(1 <= (b - a) <= 3 for a, b in itertools.pairwise(report))
+        def is_increasing_safe(report: Report):
+            for a, b in itertools.pairwise(report):
+                if not 1 <= (b - a) <= 3:
+                    return False
+            return True
 
         return is_increasing_safe(report) or is_increasing_safe(report[::-1])
 

2024/d16/ex2/ex2.py

@@ -99,7 +99,7 @@ def solve(input: str) -> int:
                     if pred in visited:
                         continue
                     queue.add(pred)
-            return {p for p, _ in visited}
+            return set(p for p, _ in visited)
 
         # Priority queue of (distance, point)
         queue = [(0, start, Direction.EAST)]

2024/d18/ex1/ex1.py

@@ -2,8 +2,7 @@
 
 import heapq
 import sys
-from collections.abc import Iterator
-from typing import NamedTuple
+from typing import Iterator, NamedTuple
 
 
 class Point(NamedTuple):