Well, this is my first time doing Advent of Code, let alone doing it in Rust. But I'm excited to learn more about the language and hopefully get better at it.
I do not recommend you copy the exact answer, since it is different for everyone. But if you want to run it, you can do so by first cd'ing into the directory of the day you want to run, and then running cargo run --bin part1
or cargo run --bin part2
depending on which part you want to run.
The whole point of Advent of Code is to learn and get better at programming. So I will be honest about my progress and how I did it. If I did use a reference or copied the answer, I will say so. There is no point in lying about it.
This year is just me getting my toes wet with AOC and Rust. I'm not going to be too hard on myself if I can't solve a problem. I'm just going to see how other people solved it and learn from them.
Well, since I am actually copying from other solutions when I can't solve it, I will be honest about my stats. I will be using the following system:
- Solved it myself
- Solved it with reference
- Understood and Copied the answer
- To be reviewed later
Well, hopefully I can get better at this.
Even though my AOC profile will show that I have all the stars, my actual stars, the ones that I did myself, are around 20
- Day 1
- Day 2
- Day 3
- Day 4
- Day 5 (I)
- Day 6
- Day 7
- Day 8
- Day 9
- Day 10
- Day 11
- Day 12
- Day 13
- Day 14
- Day 15
- Day 16
- Day 17
- Day 18
These are usually problems for which I was able to solve part 1, but not part 2. So I had to look at the answer to part 2, realize my mistake, and then solve it.
- Day 13 (Part 2)
- Day 16
These are problems that I copied off another answer, but I took the time to understand it and learn from it.
- Day 11 (Part 2)
- Day 14 (Part 2)
- Day 17
- Day 19
These are problems that I was able to solve, but I feel like I could have done better. So I will be reviewing them later.
- Day 8
- Day 11
- Day 14
- Dijkstra's Algorithm
- Min Max Algorithm
- A* Algorithm
- Shoe Lace Algorithm
This is under the MIT License.
You are free to use this code as a reference, but mine is probably not the best way to do it. Moreover, try doing it yourself first before looking at my code. It's more fun that way.