aboutsummaryrefslogtreecommitdiffstats
path: root/AoC2022
Commit message (Expand)AuthorAgeFilesLines
* preliminary stack of statesOscar Najera2023-01-121-5/+81
* solve day 19 part 1 LISPOscar Najera2023-01-111-32/+75
* cleaning upOscar Najera2023-01-111-44/+16
* solves exampleOscar Najera2023-01-111-39/+40
* AGG Mutable stateOscar Najera2023-01-113-0/+140
* some isolation of tasksOscar Najera2023-01-111-5/+10
* property based distance testOscar Najera2023-01-111-0/+10
* Day 18 part 2Oscar Najera2023-01-071-1/+45
* Day 18Oscar Najera2023-01-073-0/+2792
* Day 17 do it in emacs too slowOscar Najera2023-01-072-1/+149
* Some cleanupOscar Najera2023-01-061-19/+17
* Drop those type annotations that didn't speedupOscar Najera2023-01-061-30/+14
* Day 17 part 2Oscar Najera2023-01-061-30/+35
* finding a periodOscar Najera2023-01-061-19/+45
* some typing hoping speedupOscar Najera2023-01-061-29/+67
* solve day 17 part 1Oscar Najera2023-01-063-0/+92
* reorder cleanupOscar Najera2022-12-201-104/+105
* orderOscar Najera2022-12-191-38/+41
* early exit for unpromissing pathsOscar Najera2022-12-191-35/+57
* compactOscar Najera2022-12-191-38/+32
* reduce no loopOscar Najera2022-12-191-9/+12
* reduce instead of sortOscar Najera2022-12-191-5/+4
* Create directly next moves listOscar Najera2022-12-191-14/+17
* denest moreOscar Najera2022-12-191-24/+26
* isolate and denestOscar Najera2022-12-191-36/+34
* appropriate only does check no next-options redefOscar Najera2022-12-191-14/+10
* run test on makefile not on scriptOscar Najera2022-12-1815-15/+14
* Logical path test instead of memberOscar Najera2022-12-181-23/+21
* unify solution with part1Oscar Najera2022-12-181-42/+13
* track current flow in place not on sorting. SpeedupOscar Najera2022-12-181-13/+23
* test cleanupOscar Najera2022-12-181-16/+23
* ??graph to hashtableOscar Najera2022-12-181-9/+13
* some cleanupsOscar Najera2022-12-181-50/+61
* Solving day 16Oscar Najera2022-12-181-24/+95
* Return optimal path tooOscar Najera2022-12-181-17/+21
* LISP solve part 1 day 16Oscar Najera2022-12-181-99/+35
* traverse but not optimumOscar Najera2022-12-181-24/+120
* lisp try day 16Oscar Najera2022-12-183-0/+125
* day 15 redo part 1 for speedOscar Najera2022-12-171-21/+43
* [AoC2022] Common LISP day 15 fast enough solutionOscar Najera2022-12-172-143/+119
* organizingOscar Najera2022-12-171-52/+59
* simple coverage againOscar Najera2022-12-171-24/+99
* no record vector on counterOscar Najera2022-12-171-17/+9
* search failOscar Najera2022-12-171-22/+49
* Day 15 solve part 1Oscar Najera2022-12-171-0/+25
* Day 15 CL eg monitor coverOscar Najera2022-12-171-16/+45
* cl draw exampleOscar Najera2022-12-172-0/+67
* CL simpler functions more codeOscar Najera2022-12-161-27/+36
* [AoC2022] Day 14 solve common lispOscar Najera2022-12-161-9/+19
* Common lispOscar Najera2022-12-161-0/+102
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 10:38:32 +0000