Day 85 - MeetAMentor Clojure Study Group
Inspired by the broadcasting by Tim Pote of his solutions to Advent of Code, I did my own spin of the first day of challenges.
Code from todayλ︎
Advent of code day oneλ︎
A new Leiningen project created with the default template. Updated licence to Creative Commons.
The first part of day one is a simple reduce + over the specific data set of frequency adjustments. Added the unique data set for day one using a different namespace as its a long data set.
To see if there was any performance difference with using either apply or reduce functions, gathered timing and bench marking results using the advent of code data set. Results show that apply is faster in this instance.
Part two was tricky as we need to manage state while we process the frequency-changes. We need to keep track of the frequencies that we adjust the device to each time.
I tried out the imperative and mutable solution (DONT DO THIS AT HOME!) that Tim Pote discussed in his broadcast and it worked, although did not feel at all like Clojure.
Then I took a functional approach with recursion, using loop and recur at a pretty low level of abstraction.
Again that worked, although the code is a little procedural and certainly not getting the most out of Clojure.
The design was evolved to using reduce and then further to use reductions to create all the intermediary results of the reduce. This made a pretty great abstraction on the design and a really simple expression.
One thing that was missing was a function similar to distinct except the just the duplicates were kept, so a simple helper function was added.
Thank you.
Practical.li Website