This site does not allow itself to be embedded. You can still read it on the original site — the toolbar below keeps your place in the directory.
Day 8 was brutal. Not because the algorithm is complex - but because I kept making implementation mistakes that cost hours of debugging. The Problem Given 3D coordinates of junction boxes, connect them with light strings. Connect the closest pairs first, forming circuits. After making a certain number of connections, find the sizes of the three largest circuits. This is essentially asking: perform…
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.