advent_of_code VS aoc2023

Anyway my solution available on my GitHub

This was a tricky one, but I managed to solve it in an effective way (the lcm method). As always you can see it on my GitHub.

I really loved this one, I enjoyed doing it and I'm happy with how I managed to deal with it. You can see my solution to both parts on my GitHub.

My Day 6 solution on GitHub

Anyway, here it is.

I eventually tend to do all days in Tailspin. The ones I have done so far are in directories ending in "tt" (the others are in Pyret, just to get a feel for it) https://github.com/tobega/aoc2023/tree/main

As a general tip, it is often helpful to first try to think of how you would like to represent the data in your program. Then you need to parse the data into that structure. I'd recommend you to look at a PEG-parser, for example. Or if you like, look at my Tailspin programming language which has a very visual parser syntax and also very visual ways of creating data structures (if that should happen to be your mental affinity). Look at my day1 for example. Or if you're more mathematical, maybe a functional language (I also did day1 in Pyret)