Our great sponsors
 InfluxDB  Power RealTime Data Analytics at Scale
 WorkOS  The modern API for authentication & user identity.
 Onboard AI  ChatGPT with full context of any GitHub repo.


awesomeadventofcode
A collection of awesome resources related to the yearly Advent of Code challenge.

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

Jokes aside, I started this year and solved a couple of problems like this. I really liked the challenged, discovered and read about something called graphs in mathematics and Hamiltonian paths. There is a simple part and an algorithm part. The simple part is "listing" all the dots there. Imagine a table of elements, every dot has its sub table with its name and connections (where you have a list of all the other Dots you could directly go from this one). Then comes the algorithm, which can be as elaborate as you want. Usually, if you don't mind performance time, it becomes simple since you only need to tell the program "start here, end here, go through all possible paths and give me the shortest one" Then, if you need to have a better performance, you adapt one of the many know algorithms for pathfinding, like the dikjistra one. For those, when adapted into your code, you "just" give them your table of dots with their connections and they will return you the "shortest" path, or the first they found, depending on the algorithm. The challenge I found most useful to understand this was from codewars. https://www.codewars.com/kata/5a667236145c462103000091 And here you can se a demonstration of those algorithms (just imagine that every square, in this case, would be one of those dots and instead of 4 connections they have the ones showed here) https://qiao.github.io/PathFinding.js/visual/
Related posts
 [2023] A list of solutions for this year and years past
 [2022 day 19] after trying ever day for the last 11 days, nothing seems to work
 🎄 2022 Day 25 Solutions 🎄
 [2022 Days 110] [Python] A graphical representation of The Beast, a single line of code that solves every day's challenge so far!
 Day 6: algorithmic complexity analysis