Advent_of_Code_in_Pascal VS aoc

I'm doing it in Lazarus/Free Pascal again.

https://github.com/mikewarot/Advent_of_Code_in_Pascal

Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!

Pascal 2235/4609

Pascal - Github

Pascal 7079/6330 - github

Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr

My pascal based solver eventually got valid text out of your input.

Pascal 2437/6187

Pascal 3590/5744

1076/1738 — Raw solution (to refactor/possibly rewrite)

Solution

Busy day today, going back to sleep zzZZZ. Clean solution and walkthrough here later today (hopefully).

If you're using Python, you can check this guy walkthroughs, he's good at explaining things and uses many Python's features to write clean code. I'd suggest to try tackle a problem on your own, and whether you manage to get a solution or not, read his walkthrough, and re-implement a solution using his ideas. This is what I did two years ago and it was a big help for me, I was more and more able to come up with solutions without looking at what he did. I still check what he does today, but I always solve the problem on my own first now.

758/2614 — Soluzione Python 3 — Walkthrough (inglese)

Solutions and walkthroughs for most of the years.

Congrats /u/skifire13 per il rank #233 globale, nice!