advent-of-code

Advent of code solutions (by EmilOhlsson)

Advent-of-code Alternatives

Similar projects and alternatives to advent-of-code

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better advent-of-code alternative or higher similarity.

advent-of-code reviews and mentions

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-06.
  • [2022 Day 12][Lua] Solver implemented as neovim plugin, with colorized heightmap
    1 project | /r/adventofcode | 12 Dec 2022
    Plugin can be found here
  • -🎄- 2022 Day 7 Solutions -🎄-
    248 projects | /r/adventofcode | 6 Dec 2022
    This Lua code is run by loading the solver as a plugin, and then open the input file in neovim and run :AoC 2022 07 1. Haven't really befriended Lua yet though https://github.com/EmilOhlsson/advent-of-code/blob/main/lua/advent-of-code/2022/07.lua
  • -🎄- 2021 Day 5 Solutions -🎄-
    220 projects | /r/adventofcode | 4 Dec 2021
    Created a specific iterator for the ranges, that made the code quite nice. rust fn solve_p1(input: &str) -> usize { let mut lines = HashMap::<(i32, i32), u32>::new(); for ((x1, y1), (x2, y2)) in parse(input) { if x1 == x2 || y1 == y2 { let steps = cmp::max((x2 - x1).abs(), (y2 - y1).abs()) + 1; let xs = Range::new(x1, x2, steps); let ys = Range::new(y1, y2, steps); for p in xs.zip(ys) { let point = lines.entry(p).or_insert(0); *point += 1; } } } lines.values().filter(|&c| *c >= 2).count() } Full code is here
  • -🎄- 2021 Day 3 Solutions -🎄-
    230 projects | /r/adventofcode | 2 Dec 2021
    Full code is available here
  • -🎄- 2021 Day 2 Solutions -🎄-
    250 projects | /r/adventofcode | 1 Dec 2021
    (define (solve-part2 input) (let next ([depth 0] [distance 0] [aim 0] [input input]) (if (null? input) (* distance depth) (let ([instr (caar input)] [amount (string->number (cadar input))]) (cond [(equal? "forward" instr) (next (+ depth (* aim amount)) (+ distance amount) aim (cdr input))] [(equal? "down" instr) (next depth distance (+ aim amount) (cdr input))] [(equal? "up" instr) (next depth distance (- aim amount) (cdr input))]))))) ``` Full code is here
  • -🎄- 2021 Day 1 Solutions -🎄-
    252 projects | /r/adventofcode | 30 Nov 2021
    (define (solve-part2 input) (let [(filtered (map (λ (l) (apply + l)) (windows 3 input)))] (apply + (map bool->number (map (λ (ab) (apply < ab)) (windows 2 filtered)))))) `` Wherewindows` is defined in a helper library. Full code is here
  • A note from our sponsor - SaaSHub
    www.saashub.com | 7 May 2024
    SaaSHub helps you find the best software and product alternatives Learn more →

Stats

Basic advent-of-code repo stats
6
2
4.8
5 months ago

Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com