CodingExercises
A variety of coding exercises for practice and to learn new languages (by AndrewTweddle)
advent-of-code
My solutions to the Advent of Code (by aaronreidsmith)
CodingExercises | advent-of-code | |
---|---|---|
14 | 25 | |
3 | 5 | |
- | - | |
8.9 | 8.0 | |
3 months ago | 4 months ago | |
Rust | Scala | |
- | - |
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.
CodingExercises
Posts with mentions or reviews of CodingExercises.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-12-06.
-
-❄️- 2023 Day 6 Solutions -❄️-
NB: The average durations are calculated using utility methods in lib.rs
-
-❄️- 2023 Day 5 Solutions -❄️-
GitHub - Part 1 and 2
-
-❄️- 2023 Day 1 Solutions -❄️-
Part 1 - 72µs, excluding I/O
-
Trying to create a graph or tree that references its parent
For reference, here's my rather verbose solution.
-
-🎄- 2022 Day 6 Solutions -🎄-
Python - 9 LOC. Quite a pleasing solution...
-
-🎄- 2022 Day 5 Solutions -🎄-
Rust - 101 LOC (excluding unit tests).
-
-🎄- 2022 Day 4 Solutions -🎄-
Rust - 36 LOC, excluding unit tests. The code seems quite neat to me.
-
-🎄- 2022 Day 2 Solutions -🎄-
Rust: part 1, part 2 Python: part 1, part 2
-
How to time execution of whole program?
Here's how I do it: https://github.com/AndrewTweddle/CodingExercises/blob/master/project_euler/src/bin/problem36_loop_over_3_digits.rs
-
-🎄- 2021 Day 14 Solutions -🎄-
Part 1 (Rust) - pretty simple.
advent-of-code
Posts with mentions or reviews of advent-of-code.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-12.
-
-🎄- 2022 Day 13 Solutions -🎄-
Scala using µJson. Really happy with how concise this is. I was able to parse everything into a Packet class that extends Ordered, which gives us the compare function. So once that was implemented recursively according to the rules we were given, I was able to jsut call .sorted for part 2.
-
-🎄- 2022 Day 12 Solutions -🎄-
Scala using jgrapht. I thought part 2 would require a different graph (similar to 2018 day 22) since the story said "to avoid needing to get out your climbing gear..." Glad that wasn't the case!
-
-🎄- 2022 Day 11 Solutions -🎄-
Scala. Pretty happy with how I parsed these into anonymous instances of my Monkey trait. For me part 2 wasn't hard because of the modulo trick, but because I was using mutable queues. So I had to add a reset() method to get things back the way they were before running part 2
-
-🎄- 2022 Day 10 Solutions -🎄-
Scala using tail recursion. Not the prettiest, but it works
-
-🎄- 2022 Day 9 Solutions -🎄-
Scala. Not too bad with my Point helper class. After part 1 I refactored the movements into a move helper that just takes 2 arbitrary points; the current point and the one we are moving towards. Then it was easy enough to just apply that in order each iteration for part 2.
-
-🎄- 2022 Day 8 Solutions -🎄-
Scala. It's ugly, but it works ¯\_(ツ)_/¯
-
-🎄- 2022 Day 5 Solutions -🎄-
Scala. Parsing wasn't as hard as I thought it would be using transpose and then just filtering non-alphanumeric characters. I initially parsed to a Map[Int, mutable.Stack[Char]] but then that bit me in part 2 when I would have to "reset" it (dang mutability!). So instead I parse to Map[Int, String] and just build the mutable stacks twice.
-
-🎄- 2022 Day 4 Solutions -🎄-
Updated version using sets instead of ranges
-
-🎄- 2022 Day 2 Solutions -🎄-
Scala. A little more verbose than I would like, but it works ¯\_(ツ)_/¯
-
-🎄- 2022 Day 1 Solutions -🎄-
Scala
What are some alternatives?
When comparing CodingExercises and advent-of-code you can also consider the following projects:
aoc
AdventOfCodeHaskell - Advent of Code in Haskell
advent-of-code-2022-erlang - Advent of code 2022 - implemented in Erlang
advent-of-code
advent_of_code_2022 - My solutions to Advent of Code 2022 https://adventofcode.com/2022 [Moved to: https://github.com/PetchyAL/AoC2022]
advent-of-code-rust - 🎄Starter template for solving Advent of Code in Rust.
AdventOfCode - My journey in Advent of Code
advent-of-code-2022 - 🎄 My Advent of Code solutions in Rust. http://adventofcode.com/2022
AOC2022 - Advent Of Code 2022
adventofcode - Advent of Code challenge solutions
Advent-of-Code-2022-solutions - https://adventofcode.com/
AdventOfCode-Day4-CampCleanup - .NET Core console app that solves the AdventOfCode Day 3 puzzle - Camp Cleanup
CodingExercises vs aoc
advent-of-code vs AdventOfCodeHaskell
CodingExercises vs advent-of-code-2022-erlang
advent-of-code vs advent-of-code
CodingExercises vs advent_of_code_2022
advent-of-code vs advent-of-code-rust
CodingExercises vs AdventOfCode
advent-of-code vs advent-of-code-2022
CodingExercises vs AOC2022
advent-of-code vs adventofcode
CodingExercises vs Advent-of-Code-2022-solutions
advent-of-code vs AdventOfCode-Day4-CampCleanup