This repo contains solutions for Advent Of Code 2021. To add spice to it, I use different "programming languages", some I've never used before.
If you want to challenge me, write me a programming language and let's go. How about Prolog, Basic or MatLab?
Day | Part 1 | Part 2 |
---|---|---|
1 | C# .NET 6 | C# .NET 6 |
2 | Rust | Rust |
3 | MS Excel | GoLang |
4 | PHP | PHP |
5 | GLSL (OpenGL / C++) | GLSL (OpenGL / C++) |
6 | Ada | Ada |
7 | Matlab | Matlab |
8 | C# .NET 6 * | C# .NET 6 * |
9 | Java | Java |
10 | Fortran | Fortran |
11 | Blitz3D | Blitz3D |
12 | Kotlin | Kotlin |
13 | F# | F# |
14 | Python | Python |
15 | (Vanilla) JavaScript | (Vanilla) JavaScript |
16 | Lua | Lua |
17 | Delphi | Delphi |
18 | Scala | Scala |
19 | Visual Basic .NET | Visual Basic .NET |
20 | CUDA (C) | CUDA (C) |
21 | Haskell | Haskell * |
22 | Groovy | Groovy |
23 | (Vanilla) TypeScript | (Vanilla) TypeScript |
24 | Dart | Dart |
25 | OpenMP (C++) | - |
* Day 8 : Due to time constraints, I decided to use my home zone programming language. Possibly I will re-implement this in another language. Anyway: a code can't get any dirtier than this. 🤣
* Day 21: Part 2 produces the right solution. Unfortunately it is reeeaaaly slow and hungry for RAM. If you are not holding a power computer, you probably do not want to run it till a score of 21. There may (?) be an easy solution with some memoization (aka dynamic programming) but my Haskell skills are not sufficient enough to get this done. To overcome my weakness, I transpiled the algorithm into .NET, utilized a Dictionary and was happy.