summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2018-11-17Scaffolded out files for each day of the advent of codeJustin Worthe
These don't really do anything except make it a bit easier and faster to start the day's challenge.
2018-11-17Initial scaffolding for doing advent of code challengesJustin Worthe
Mostly just having a project and a convenient way of reading in a file.
2017-12-25Day 25: The Turing machineJustin Worthe
2017-12-24Day 24: I will build the strongest lego-bridge in the galaxy!Justin Worthe
2017-12-23Day 23: Rewrite this assembly as a decent program...Justin Worthe
2017-12-22Day 22: Viruses on a planeJustin Worthe
2017-12-21Day 21: Excessive pattern matchingJustin Worthe
It feels a bit manual at the moment, the way I did arrays, but it runs ridiculously fast.
2017-12-21Template for remaining daysJustin Worthe
2017-12-20Day 20: Colliding points in 3DJustin Worthe
2017-12-19Day 19: Follow the pathJustin Worthe
I had to change my input stuff for this one. I hope no longer trimming leading whitespace won't break any previous solutions.
2017-12-18Day 18: Just implement this multicore cpu for me quickly...Justin Worthe
2017-12-17Day 17: Circular bufferJustin Worthe
2017-12-16Day 16: Now do it a billion times...Justin Worthe
2017-12-15Day 15: Bitwise and, and the generatorsJustin Worthe
2017-12-14Day 14: defragJustin Worthe
2017-12-13Day 13: Navigating the firewallJustin Worthe
2017-12-12Day 12: Grouping processesJustin Worthe
2017-12-11Day 11: Hex distancesJustin Worthe
2017-12-10Day 10: Bad hashingJustin Worthe
2017-12-10Day 9: Cleaning up garbageJustin Worthe
2017-12-08Day 8: CPU InstructionsJustin Worthe
2017-12-07Day 7: Towers on platesJustin Worthe
2017-12-06Day 6: memory rebalancingJustin Worthe
2017-12-05Day 5: CPU jumpsJustin Worthe
2017-12-04Day 4: passphrase anagramsJustin Worthe
2017-12-03Day 3: Spirals...Justin Worthe
2017-12-02Day 2Justin Worthe
2017-12-01Added licenseJustin Worthe
2017-12-01Day 1: sum of charactersJustin Worthe
2017-11-30Set up base repo with common file reading and CLIJustin Worthe
2016-12-25AOC25Justin Worthe
2016-12-24AOC24Justin Worthe
2016-12-23AOC23Justin Worthe
2016-12-22AOC part 2Justin Worthe
The trick is to round to the nearest 100, so states can be considered 'equivalent' through multiple paths.
2016-12-22AOC22 work in progressJustin Worthe
Has crazy hack optimization to work for the data set, assuming all data is about moving the 'gap' around. It hasn't run to completion yet.
2016-12-22AOC21Justin Worthe
2016-12-20AOC 20Justin Worthe
2016-12-19AOC19 part 2Justin Worthe
Works, but the performance is awful. There must be a better way.
2016-12-19AOC19 part 1Justin Worthe
runs fairly fast, but does not translate easily to part 2
2016-12-18AOC18Justin Worthe
2016-12-17AOC17Justin Worthe
2016-12-16AOC16Justin Worthe
2016-12-15Changed input parsing to decrease number of unwrapsJustin Worthe
2016-12-15AOC15Justin Worthe
2016-12-14AOC14 added memoization of hashing to run in reasonable timeJustin Worthe
2016-12-14AOC14Justin Worthe
Should work for part 2, but the performance isn't there yet
2016-12-13Cleaned up files that should have been in .gitignoreJustin Worthe
2016-12-13AOC13Justin Worthe
2016-12-12Better regexesJustin Worthe
2016-12-12Perf AOC12Justin Worthe