I just solved the first couple problems of advent of code, and wondering if I use ->>
too much.
https://gist.github.com/jaihindhreddy/f272a0055389e2b55129f2bc8cb8233b
Is it just me, or won’t part-2
not find correct matches if they are only different in the first character?
The (sort ..) (partition ..)
seems to imply that potential candidates are next to each other.
Oops! You're right. It's broken. Fixed it. Thanks a lot for the feedback! More feedback is always appreciated.
How can I make this code idiomatic (assuming it isn't)?