https://github.com/goggle/adventofcode2024.jl
Advent of Code 2024 in Julia
https://github.com/goggle/adventofcode2024.jl
advent-of-code advent-of-code-2024 advent-of-code-2024-julia aoc aoc2024 julia
Last synced: 3 months ago
JSON representation
Advent of Code 2024 in Julia
- Host: GitHub
- URL: https://github.com/goggle/adventofcode2024.jl
- Owner: goggle
- License: mit
- Created: 2024-12-02T14:52:02.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-12-18T17:59:58.000Z (11 months ago)
- Last Synced: 2024-12-18T19:19:56.129Z (11 months ago)
- Topics: advent-of-code, advent-of-code-2024, advent-of-code-2024-julia, aoc, aoc2024, julia
- Language: Julia
- Homepage:
- Size: 90.8 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# AdventOfCode2024
[](https://github.com/goggle/AdventOfCode2024.jl/actions/workflows/CI.yml?query=branch%3Amain)
This Julia package contains my solutions for [Advent of Code 2024](https://adventofcode.com/2024/).
## Overview
| Day | Problem | Problem type | Algorithms / Data structures | Time | Allocated memory | Source |
|----:|:-------:|:-------------|:-----------------------------|-----:|-----------------:|:------:|
| 1 | [:white_check_mark:](https://adventofcode.com/2024/day/1) | Array manipulation | Sorting | 459.477 μs | 461.83 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day01.jl) |
| 2 | [:white_check_mark:](https://adventofcode.com/2024/day/2) | Array manipulation | Brute Force, Linear Search | 2.070 ms | 3.64 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day02.jl) |
| 3 | [:white_check_mark:](https://adventofcode.com/2024/day/3) | String Parsing | Regular Expressions, Sliding Window | 470.249 μs | 376.73 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day03.jl) |
| 4 | [:white_check_mark:](https://adventofcode.com/2024/day/4) | Grid | Pattern Matching | 1.798 ms | 3.06 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day04.jl) |
| 5 | [:white_check_mark:](https://adventofcode.com/2024/day/5) | Graph | Topological Sorting | 2.104 ms | 1.26 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day05.jl) |
| 6 | [:white_check_mark:](https://adventofcode.com/2024/day/6) | Simulation | Graph Traversal, Cycle Detection | 89.797 ms | 38.00 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day06.jl) |
| 7 | [:white_check_mark:](https://adventofcode.com/2024/day/7) | Expression Evaluation | Recursion | 30.710 ms | 1.53 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day07.jl) |
| 8 | [:white_check_mark:](https://adventofcode.com/2024/day/8) | Grid | Line Tracing, Grid Traversal | 94.050 μs | 46.30 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day08.jl) |
| 9 | [:white_check_mark:](https://adventofcode.com/2024/day/9) | Array manipulation | Greedy | 28.311 ms | 9.58 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day09.jl) |
| 10 | [:white_check_mark:](https://adventofcode.com/2024/day/10) | Grid | Recursion, DFS | 578.868 μs | 633.67 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day10.jl) |
| 11 | [:white_check_mark:](https://adventofcode.com/2024/day/11) | Simulation | Dynamic Programming, Memoization | 8.034 ms | 14.33 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day11.jl) |
| 12 | [:white_check_mark:](https://adventofcode.com/2024/day/12) | Grid | DFS | 4.995 ms | 5.97 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day12.jl) |
| 13 | [:white_check_mark:](https://adventofcode.com/2024/day/13) | Linear Algebra | Linear Systems | 3.101 ms | 1.15 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day13.jl) |
| 14 | [:white_check_mark:](https://adventofcode.com/2024/day/14) | Simulation | Brute Force | 26.443 ms | 274.98 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day14.jl) |
| 15 | [:white_check_mark:](https://adventofcode.com/2024/day/15) | Simulation | Flood Fill, BFS | 1.944 ms | 3.16 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day15.jl) |
| 16 | [:white_check_mark:](https://adventofcode.com/2024/day/16) | Path Finding, Grid | Dijkstra's Algorithm, BFS, Priority Queue, Deque | 20.822 ms | 9.21 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day16.jl) |
| 17 | [:white_check_mark:](https://adventofcode.com/2024/day/17) | Virtual Machine | Simulation, Reverse Engineering, Backtracking | 6.921 ms | 706.30 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day17.jl) |
| 18 | [:white_check_mark:](https://adventofcode.com/2024/day/18) | Path Finding | BFS, Binary Search | 3.007 ms | 5.51 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day18.jl) |
| 19 | [:white_check_mark:](https://adventofcode.com/2024/day/19) | Strings | Backtracking, Memoization, Recursion | 57.908 ms | 3.41 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day19.jl) |
| 20 | [:white_check_mark:](https://adventofcode.com/2024/day/20) | Path Finding | BFS, Grid Traversal | 49.638 ms | 701.11 KiB| [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day20.jl) |
| 21 | [:white_check_mark:](https://adventofcode.com/2024/day/21) | Path Finding, Simulation | Memoization, Graph Traversal, Deque | 296.609 μs | 78.89 KiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day21.jl) |
| 22 | [:white_check_mark:](https://adventofcode.com/2024/day/22) | Simulation | Bitwise operations, Hashing, Memoization | 25.522 ms | 1.18 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day22.jl) |
| 23 | [:white_check_mark:](https://adventofcode.com/2024/day/23) | Graph | DFS, Clique Detection, Adjacency Matrix | 4.197 ms | 3.82 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day23.jl) |
| 24 | [:white_check_mark:](https://adventofcode.com/2024/day/24) | Logic | Topological Sorting, Bitwise Operations | 310.021 ms | 2.16 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day24.jl) |
| 25 | [:white_check_mark:](https://adventofcode.com/2024/day/25) | Matching | Brute Force | 2.178 ms | 3.47 MiB | [:white_check_mark:](https://github.com/goggle/AdventOfCode2024.jl/blob/main/src/day25.jl) |
The benchmarks have been measured on this machine:
```
Platform Info:
OS: Linux (x86_64-linux-gnu)
CPU: 8 × Intel(R) Core(TM) i5-8250U CPU @ 1.60GHz
WORD_SIZE: 64
LIBM: libopenlibm
LLVM: libLLVM-14.0.6 (ORCJIT, skylake)
Threads: 1 on 8 virtual cores
```
## Installation and Usage
Make sure you have [Julia 1.9 or newer](https://julialang.org/downloads/)
installed on your system.
### Installation
Start Julia and enter the package REPL by typing `]`. Create a new
environment:
```julia
(@v1.8) pkg> activate aoc
```
Install `AdventOfCode2024.jl`:
```
(aoc) pkg> add https://github.com/goggle/AdventOfCode2024.jl
```
Go back to the Julia REPL by pushing the `backspace` key.
### Usage
First, activate the package:
```julia
julia> using AdventOfCode2024
```
Each puzzle can now be run with `dayXY()`:
```julia
julia> day01()
2-element Vector{Int64}:
1590491
22588371
```
This will use my personal input. If you want to use another input, provide it
to the `dayXY` method as a string. You can also use the `readInput` method
to read your input from a text file:
```julia
julia> input = readInput("/path/to/input.txt")
julia> AdventOfCode2024.Day01.day01(input)
2-element Vector{Int64}:
1590491
22588371
```