specter VS Advent_of_Code

> Another example is Specter. Specter is a generically useful library for querying and manipulating data structures

> https://github.com/redplanetlabs/specter/tree/master/src

> MutableCell.Java. 8 years ago

  package com.rpl.specter;

If you are truly interested in understanding my point of view -- a great way to do it would be to learn how to use this Clojure DSL: https://github.com/redplanetlabs/specter

For deeply nested data, use specter https://github.com/redplanetlabs/specter

Yes :), I needed a fast dijkstra implementation to solve a puzzle in 2021. A pure clojure implementation was too slow so i built one on top of this https://github.com/redplanetlabs/specter

https://github.com/redplanetlabs/specter (very powerful way to express modifications to nested data)

Don't forget about specter which is efficient and compact due to its DSL.

Learn and use specter for nested data manipulation, will take some studying but is a more general solution (https://github.com/redplanetlabs/specter)

For part 1, the version (and other things) are attached to the metadata of each sexp, and a Specter recursive path is used to extract all of the versions.

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.