Advent Of Code Solve Times As the historians wander around a secure area at easter bunny hq, you come across posters for a lan party scheduled for today! maybe you can find it; you connect to a nearby datalink port and download a map of the local network (your puzzle input). the network map provides a list of every connection between two computers. for example:. Advent of code is an annual advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.
Advent Of Code Dt In Th Python solutions to advent of code puzzles, adventofcode adventofcode 2024 day23 solutions.py at master · fuglede adventofcode. Day 23: lan party github repo solutions today's challenge was rather run, and somewhat simple (or at least part 1 was). part 1: collect all the connections in trios where any of the triangles computers begin with t. simple as that really, then count the number of triangles. Today was fun for me because i got to refactor some code we used in 2018 to solve another graph puzzle on day 23! i’m way more satisfied with the code i wrote today than the code i wrote six years ago. Another fairly straightforward puzzle, with one hiccup in how i test whether all networks are fully connected (thank you, powerset function!) and one optimisation that takes the runtime from 4 5s.
Advent Of Code With Axis Life At Axis Today was fun for me because i got to refactor some code we used in 2018 to solve another graph puzzle on day 23! i’m way more satisfied with the code i wrote today than the code i wrote six years ago. Another fairly straightforward puzzle, with one hiccup in how i test whether all networks are fully connected (thank you, powerset function!) and one optimisation that takes the runtime from 4 5s. Welcome to day 23 of advent of code using modern c . before you start reading, i highly encourage you to try to solve the two problems yourself: adventofcode 2023 day 23. Const input = await inputday(23, { parser }) display(input) const m = new map() for (const [a, b] of network) { if (!m.get(a)) m.set(a, new set()) if (!m.get(b)) m.set(b, new set()) m.get(a).add(b) m.get(b).add(a) return m. display(gather(test)). After a quick attempt to use digraph, i implemented by own straightforward algorithm to find the groups. to my surprise, i didn’t need to do any optimizations to solve both parts. the combined runtime for solving both parts was 2.5 seconds. Step by step python solutions for every puzzle in advent of code 2023.
Comments are closed.