Optimal algo for 2021 Day 19?

• advent

  2 0 0.0 Rust

  My Advent of Code solutions (by jakeledoux)

Here’s the code if you’re curious.

• aoc-2021

  5 56 5.3 Rust

  Advent of Code 2021

Mine runs in 1ms (in rust, single thread) but is fairly complicated (link).

• InfluxDB

  www.influxdata.com sponsored

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• AoC

  87 18 8.3 Python

  my personal repo for the advent of code yearly challenge (by Fadi88)

Check mine https://github.com/Fadi88/AoC/blob/master/2021/day19/main.rs Just checking orientation invariant property to get matching sensors and form there calucte rotation

• advent-of-code

  23 20 9.1 Rust

You can calculate the distances between the points found by each scanner. If two scanners report points with the same distance between them, then most probably they are adjacent. Runs in 4ms on my machine: https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-19

Suggest a related project