aboutsummaryrefslogtreecommitdiffstats
path: root/AoC2022
Commit message (Expand)AuthorAgeFilesLines
...
* ??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
* cleanup remove strideOscar Najera2022-12-161-30/+11
* [AoC2022] Elisp Day 14 two partsOscar Najera2022-12-161-26/+42
* testOscar Najera2022-12-161-11/+9
* solve ex can't use named-let run out of stack use whileOscar Najera2022-12-161-26/+23
* draw again and solve exampleOscar Najera2022-12-161-7/+39
* AoC2022 Elisp 14 draw wallsOscar Najera2022-12-162-0/+281
* DocumentationOscar Najera2022-12-131-6/+6
* cleanup and drop arrowsOscar Najera2022-12-131-11/+14
* CL line of sight function refactorOscar Najera2022-12-131-48/+23
* Include arrow dependencyOscar Najera2022-12-131-16/+14
* cleanupOscar Najera2022-12-131-6/+15
* cl cleanupOscar Najera2022-12-131-18/+11
* CL cleanup and part2Oscar Najera2022-12-131-32/+59
* CL group in functionsOscar Najera2022-12-131-33/+28
* day 8 CLOscar Najera2022-12-132-0/+55
* explicit testsOscar Najera2022-12-131-10/+9
* [AoC2022] LispOscar Najera2022-12-131-0/+42
* [AoC2022] Elisp 13Oscar Najera2022-12-131-14/+38
* [AoC2022] Elisp 13Oscar Najera2022-12-133-0/+527
* fletOscar Najera2022-12-131-9/+7
* refactor becauseOscar Najera2022-12-131-12/+9
* lisp readOscar Najera2022-12-131-15/+17
* have a structOscar Najera2022-12-131-13/+20
* Solve in LISPOscar Najera2022-12-132-1/+59
* [AoC2022] Elisp Day 12 full solutionOscar Najera2022-12-132-27/+39
* Now correctly without proliferating common pathsOscar Najera2022-12-121-46/+37
* same depthOscar Najera2022-12-121-15/+32
* [AoC2022] Elisp Day 12-01 eg depth-firstOscar Najera2022-12-122-0/+116
* [AoC2022] Elisp Day 11 part2Oscar Najera2022-12-111-18/+25
* [AoC2022] Elisp Day 11Oscar Najera2022-12-113-0/+183
* [AoC2022] Rust Day 10Oscar Najera2022-12-101-0/+55
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 13:35:54 +0000