Advent of Code 2025 - Day 11

Finally some more graph traversal! Read the full prompt. Part 1 Simple breadth-first search for Part 1. We want to know how many routes are possible to get from the start to the finish. function partOne() { const paths = []; const queue: Array<Array<string>> = [["you"]]; while (queue.length > 0) { const path = queue.shift()!; const node = path[path.length - 1]; if (node === "out") {…