feat: add adv_2024_23

pyproject.toml

@@ -9,6 +9,7 @@ packages = [{include = "solutions"}]
 [tool.poetry.dependencies]
 python = ">=3.10,<4.0.0"
 numpy = "2.2.1"
+networkx = "3.4.2"
 
 [tool.poetry.group.dev]
 optional = true

solutions/adv_2024_23.py

@@ -0,0 +1,26 @@
+import networkx  # type: ignore
+
+
+def _parse_input(in_str: str) -> networkx.Graph:
+    res = networkx.Graph()
+    for _ in in_str.splitlines():
+        node_a, node_b = _.split("-")
+        res.add_edge(node_a, node_b)
+    return res
+
+
+def _is_chief_historian(in_list: list[str]) -> bool:
+    return any(_.startswith("t") for _ in in_list)
+
+
+def solve_a(in_str: str) -> int:
+    return sum(
+        1
+        for _ in networkx.simple_cycles(_parse_input(in_str), 3)
+        if _is_chief_historian(_)
+    )
+
+
+def solve_b(in_str: str) -> str:
+    max_clique = max(networkx.find_cliques(_parse_input(in_str)), key=len)
+    return ",".join(sorted(max_clique))

tests/test_adv_2024_23.py

@@ -0,0 +1,14 @@
+import solutions.adv_2024_23 as sol
+from . import test_utils as tu
+
+
+_INPUTS = tu.get_inputs(23, {"small", "p"})
+
+
+test_solve_a, test_solve_b = _INPUTS.get_tests(
+    (sol.solve_a, sol.solve_b),
+    {
+        "small": (7, "co,de,ka,ta"),
+        "p": (1423, "gt,ha,ir,jn,jq,kb,lr,lt,nl,oj,pp,qh,vy"),
+    },
+)