aoc-2023 VS adventOfCode

Here's a link to the code: https://github.com/AJMansfield/aoc-2023/blob/master/src/07/camel.f90 You can also clone the entire repo and run it with make run, assuming you have gnu make and gfortran installed.

Part 1 straightforward implementation. Treat it as a graph and just follow the instructions.

Part 1 -> simple implementation, sort the list using a custom function. The main component is the function extractInfo which returns the number of pairs and the number of times the card with the most duplicates appears.

Part 1/Part 2 the only difference between them is the parse. Solved using Bhaskara formula

Part 1 brute force mapping each seed

Part 1: set intersection

Part 1 is nothing fancy, just scanned the data