* Formatting updates

* Add old solutions

Author: mkopec87

src/2021/day08/main.py

@@ -1,6 +1,5 @@
 from collections import defaultdict
 from functools import reduce
-from typing import Set
 
 
 def get_set_only_item(s):
@@ -53,8 +52,8 @@ def main():
         two_letters = len2signals[2][0]
         three_letters = len2signals[3][0]
         four_letters = len2signals[4][0]
-        five_letters_common: Set[str] = reduce(set.intersection, len2signals[5])
-        six_letters_common: Set[str] = reduce(set.intersection, len2signals[6])
+        five_letters_common: set[str] = reduce(set.intersection, len2signals[5])
+        six_letters_common: set[str] = reduce(set.intersection, len2signals[6])
 
         a_mapping = three_letters - two_letters
         b_d_mapping = four_letters - two_letters

src/2021/day18/main.py

@@ -1,5 +1,3 @@
-from typing import List
-
 INPUT_TXT = "input.txt"
 # INPUT_TXT = "input-small.txt"
 
@@ -77,7 +75,7 @@ def reduce(self):
 
         return False
 
-    def leaves(self) -> List["Node"]:
+    def leaves(self) -> list["Node"]:
         if self.leaf:
             return [self]
         else:

src/2021/day19/main.py

@@ -1,6 +1,5 @@
 import itertools
 from collections import Counter
-from typing import List
 
 import networkx as nx
 import numpy as np
@@ -15,7 +14,7 @@ def __init__(self, number, location=None):
         self.positions: np.array = None
         self.location = location
 
-    def add_position(self, position: List[int]):
+    def add_position(self, position: list[int]):
         if self.positions is None:
             self.positions = np.array(position)
         else:

src/2021/day21/main.py

@@ -1,7 +1,6 @@
 import dataclasses
 import itertools
 from collections import Counter
-from typing import Tuple
 
 INPUT_TXT = "input.txt"
 # INPUT_TXT = "input-small.txt"
@@ -21,8 +20,8 @@ def sum3rolls(self):
 
 @dataclasses.dataclass(frozen=True)
 class State:
-    positions: Tuple[int, int]
-    points: Tuple[int, int] = (0, 0)
+    positions: tuple[int, int]
+    points: tuple[int, int] = (0, 0)
     next_player_index: int = 0
 
     def finished(self, limit):

src/2021/day22/main.py

@@ -1,5 +1,4 @@
 from dataclasses import dataclass
-from typing import List, Tuple
 
 from tqdm import tqdm
 
@@ -11,7 +10,7 @@
 @dataclass
 class Step:
     on: bool
-    ranges: List[Tuple[int, ...]]
+    ranges: list[tuple[int, ...]]
 
     def within_range(self):
         for r in self.ranges:
@@ -32,7 +31,7 @@ def parse_step(line: str) -> Step:
     return Step(on=on, ranges=ranges)
 
 
-def parse_steps(lines: List[str]) -> List[Step]:
+def parse_steps(lines: list[str]) -> list[Step]:
     return [parse_step(line) for line in lines]
 
 

src/2021/day22/main2.py

@@ -1,7 +1,6 @@
 import itertools
 import math
 from dataclasses import dataclass
-from typing import List, Tuple
 
 import numpy as np
 from tqdm import tqdm
@@ -14,7 +13,7 @@
 @dataclass
 class Step:
     on: bool
-    ranges: List[Tuple[int, ...]]
+    ranges: list[tuple[int, ...]]
 
 
 def parse_step(line: str) -> Step:
@@ -28,7 +27,7 @@ def parse_step(line: str) -> Step:
     return Step(on=on, ranges=ranges)
 
 
-def parse_steps(lines: List[str]) -> List[Step]:
+def parse_steps(lines: list[str]) -> list[Step]:
     return [parse_step(line) for line in lines]
 
 

src/2021/day23/main.py

@@ -1,6 +1,5 @@
 from functools import lru_cache
 from queue import PriorityQueue
-from typing import Dict, List, Tuple
 
 import networkx as nx
 from matplotlib import pyplot as plt
@@ -33,7 +32,7 @@ def main() -> None:
     print(f"Result part 2: {result_part2}")  # expected for small input: 44169
 
 
-def parse_state(lines: List[str]) -> str:
+def parse_state(lines: list[str]) -> str:
     state = ""
     for i, line in enumerate(lines):
         state += line.replace("#", "")
@@ -81,7 +80,7 @@ def draw_graph(graph: nx.Graph, target_path: str) -> None:
     plt.clf()
 
 
-def dijkstra(start_state: str, graph: nx.Graph) -> Dict[str, int]:
+def dijkstra(start_state: str, graph: nx.Graph) -> dict[str, int]:
     state2cost = {start_state: 0}
     pq = PriorityQueue()
     pq.put((0, start_state))
@@ -100,7 +99,7 @@ def dijkstra(start_state: str, graph: nx.Graph) -> Dict[str, int]:
     return state2cost
 
 
-def get_neighbours(state: str, graph: nx.Graph) -> List[Tuple[str, int]]:
+def get_neighbours(state: str, graph: nx.Graph) -> list[tuple[str, int]]:
     result = []
     for index, ch in enumerate(state):
         if ch == ".":

src/2022/day03/main.py

@@ -1,9 +1,10 @@
 import itertools
 from functools import reduce
-from typing import Any, Iterator, List, Set, Tuple
+from typing import Any
+from collections.abc import Iterator
 
 
-def partition(a_list: List[Any], size: int) -> Iterator[Tuple[Any]]:
+def partition(a_list: list[Any], size: int) -> Iterator[tuple[Any]]:
     it = iter(a_list)
     return iter(lambda: tuple(itertools.islice(it, size)), ())
 
@@ -16,7 +17,7 @@ def item_to_score(item: str) -> int:
     return score
 
 
-def item_from_singleton_set(items: Set[Any]) -> Any:
+def item_from_singleton_set(items: set[Any]) -> Any:
     assert len(items) == 1
     return list(items)[0]
 

src/2022/day04/main.py

@@ -1,9 +1,7 @@
-from typing import Tuple
-
 import pandas as pd
 
 
-def parse_line(line: str) -> Tuple[pd.Interval]:
+def parse_line(line: str) -> tuple[pd.Interval]:
     spl = line.split(",")
     return tuple(parse_interval(i) for i in spl)
 

src/2022/day10/main.py

@@ -40,7 +40,7 @@ def main():
         if v - 1 <= c % 40 <= v + 1:
             matrix[x, y] = 1
 
-    print(f"Result part 2:")
+    print("Result part 2:")
     show(matrix)