Day 23 #adventofcode in the books.
You were given a network of nodes (computers in the story).
Part 1 was finding all the collections of three nodes that were were fully interconnected and contained at least one node whose name started with 't'. For this I scanned each nodes links and looked for any that connected to each other.
Part 2 was finding the largest collection of collected nodes, and then using the sorted list of their names as a password. For this I did a similar thing, looking for nodes whose links also linked to most of the same targets. Then filtered that for nodes that were in all of the returns.
I cost myself a hour though by not reading the question. The password had to be node names joined with commas not just node names joined...
[#]typescript worked well for this.
=> More informations about this toot | View the thread | More toots from walkerb@infosec.exchange
=> View adventofcode tag | View typescript tag This content has been proxied by September (ba2dc).Proxy Information
text/gemini