advent-of-code VS Advent_of_Code

Plugin can be found here

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

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

Full code is available here

(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

(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

Then I came across this Python solution, which was quite short and concise. So I implemented this solution in F#, but I had to use a mutable. I couldn't figure out how to get rid of this mutable. Is there a way, or is this solution not a F# one?

My solutution in Python. Using itertools.cycle for part 1 and functools.cache for part 2.

My solution in Python. This one was fun! Thanks for the many samples and the detailed description.

My solution in Python. At first I was really struggling but then I luckily found some A* pathfinding code I wrote many years ago.

My Solution in Python. This one is pretty compact and amazingly fast thanks to collections.Counter and functools.lru_cache. Here is the function for counting the elements:

My solution in Python. A simple search without recursion.

My solution in Python. It's astonishing how much trouble I had today despite my experience with cellular automata.Lots of off-by-one errors and problems with synchronicity.

My solution in Python. I realised that I could use the median for part 1 and mean for part 2 like some others here.

My solution in Python. Today was fun and very easy. I immediately came to the same conclusion as others here to simply count the number of fish per age group.

My solution in Python. Now it starts to get interesting. I need to remind myself to use collections and itertools more often.