aoc2020
Haskell Solutions to Advent of Code 2020 (by haskelling)
Advent_of_Code_in_Pascal
My solutions to the Advent of Code, in Free Pascal (by mikewarot)
aoc2020 | Advent_of_Code_in_Pascal | |
---|---|---|
10 | 23 | |
22 | 8 | |
- | - | |
0.0 | 0.0 | |
over 2 years ago | over 1 year ago | |
Haskell | Pascal | |
GNU General Public License v3.0 only | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
aoc2020
Posts with mentions or reviews of aoc2020.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2020-12-26.
-
Can you share a real-world anecdote of when laziness helped simplify your code/project structure?
https://github.com/haskelling/aoc2020/blob/main/AOC.hs#L285-L292
-
Whatβs up with IntCode 2019?
I sometimes used Parsec, and sometimes splitOn from Data.List.Split, but normally managed to get the parsing side working pretty quickly. My code is at https://github.com/haskelling/aoc2020 if you're interested.
-
Advent of Code 2020, Day 25 [Spoilers]
Video walkthrough and code repo.
-
-π- 2020 Day 23 Solutions -π-
Code Repository: https://github.com/haskelling/aoc2020
-
Advent of Code, Day 22 [Spoilers]
Code: https://github.com/haskelling/aoc2020 Video: https://youtu.be/26EvM7WhjU8
-
2020 Day 20 Solutions
Part 2: https://github.com/haskelling/aoc2020/blob/main/20b.hs
-
-π- 2020 Day 22 Solutions -π-
Code Repository: https://github.com/haskelling/aoc2020
-
Instantly thought of this when I saw this template
By the way, my code for day 20 is already on GitHub.
-
It's so frustrating to not be able to know or google any concepts behind a problem, even though you are confident that there are.
As for the CS algorithms and concepts required, indeed many of the part 2s are for sure only really doable with university-level training. Fortunately, though, there are many universities that put their lectures online. One is MIT, and I would highly recommend watching MIT 6.006 and 6.046, available free on the MIT OpenCourseWare YouTube channel. The lectures on dynamic programming are particularly pertinent for both 7b and 10b. In fact, the solutions I had for both boiled down to the same algorithm: summarising a DAG (directed acyclic graph) from the leaves up, so I was able to reuse my code and solve 10b really quickly.
-
AoC 2020 - Day 16 - Task 2 - need Help please [Dart]
My AoC code is at https://github.com/haskelling/aoc2020 but I'm afraid it's not in Dart. I have to admit that I haven't actually done much Dart for a few years, so I saw your post as an opportunity to see if I could remember a bit. My code in all languages these days is now very much influenced by Haskell, which I'm using for AoC. If you're interested, I also have a video series about solving AoC2020 in Haskell: https://www.youtube.com/channel/UCcrYL-tiYTlULpi_BGB44QA/videos
Advent_of_Code_in_Pascal
Posts with mentions or reviews of Advent_of_Code_in_Pascal.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-30.
-
Advent of Code 2022
I'm doing it in Lazarus/Free Pascal again.
https://github.com/mikewarot/Advent_of_Code_in_Pascal
-
-π- 2021 Day 22 Solutions -π-
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!
-
-π- 2021 Day 21 Solutions -π-
Pascal 2235/4609
-
-π- 2021 Day 18 Solutions -π-
Pascal - Github
-
-π- 2021 Day 16 Solutions -π-
Pascal 7079/6330 - github
-
-π- 2021 Day 15 Solutions -π-
Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr
-
day 13 result issue, someone can help?
My pascal based solver eventually got valid text out of your input.
- -π- 2021 Day 13 Solutions -π-
-
-π- 2021 Day 9 Solutions -π-
Pascal 2437/6187
-
-π- 2021 Day 8 Solutions -π-
Pascal 3590/5744