Advent-of-Code VS Advent_of_Code_in_Pascal

git repo

Very ugly, very hardcoded, very dirty, and a really quick C# solution. Will clean up it in the next couple of days.

C# solution, this day is the day when my code for the first part returns the correct value for the second part! Secret is that I didn't read that I need numbers of dots after the first fold and I did print results out of curiosity. But it works!

Solution using Stack in C#

Some really ugly C# solution

not my proudest C# solution

C# repo. Happy AoC everyone!

C# repo

C# (C Sharp)

Github repo, this is done, three more days to go...

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