aboutsummaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* reorder refactorOscar Najera2023-12-141-12/+10
|
* optimization hash-table instead of list 10x betterOscar Najera2023-12-141-14/+13
|
* solve part2Oscar Najera2023-12-141-19/+67
|
* [AoC2023] day10 part1 lispOscar Najera2023-12-142-0/+227
|
* more refactoringOscar Najera2023-12-141-16/+10
|
* refactoringOscar Najera2023-12-141-32/+30
|
* [AoC2023] Day09 lisp 1&2Oscar Najera2023-12-142-0/+246
|
* refactorOscar Najera2023-12-081-15/+9
|
* solution part2Oscar Najera2023-12-081-22/+48
|
* [AoC2023] day08 lisp part1Oscar Najera2023-12-082-0/+797
|
* part2Oscar Najera2023-12-071-21/+52
|
* [AoC2023] day07 lisp part1Oscar Najera2023-12-072-0/+1080
|
* solution part 2Oscar Najera2023-12-061-3/+21
|
* [AoC2023] day06 lisp part 1Oscar Najera2023-12-062-0/+42
|
* day05 bug finally found and fixedOscar Najera2023-12-061-37/+18
| | | | | | | I had poor control of bounds. Right simple tests, it is not that hard, debugging by reading takes forever.
* day05 try with ranges fail to solveOscar Najera2023-12-061-37/+121
|
* [AoC2023] day05 lisp too slowOscar Najera2023-12-052-0/+314
|
* Solve day04 part2Oscar Najera2023-12-041-3/+31
|
* [AoC2023] day04 part 1 lispOscar Najera2023-12-042-0/+239
|
* refactor day03Oscar Najera2023-12-041-51/+19
|
* [AoC2023] day03 lispOscar Najera2023-12-043-0/+228
|
* day02 refactor with structOscar Najera2023-12-031-32/+28
|
* [AoC2023] day02 lispOscar Najera2023-12-032-0/+179
|
* fix second instanceOscar Najera2023-12-031-23/+15
|
* [AoC2023] day01 lisp fail 2ndOscar Najera2023-12-034-0/+1109
|
* refactor, using collectorOscar Najera2023-04-062-41/+53
|
* cleanupOscar Najera2023-02-121-26/+23
|
* day06Oscar Najera2023-02-112-0/+16
|
* Clojure day05Oscar Najera2023-02-113-16/+55
|
* day02Oscar Najera2023-02-083-20/+66
|
* day04Oscar Najera2023-02-072-0/+30
|
* day 3 reviewOscar Najera2023-02-064-19/+49
|
* working with more stuffOscar Najera2023-02-053-12/+37
|
* Try clojure for day 1 and test transducersOscar Najera2023-02-056-0/+66
|
* more julia and formattedOscar Najera2023-01-287-12/+77
|
* more juliaOscar Najera2023-01-261-0/+15
|
* Learning some juliaOscar Najera2023-01-265-27/+108
|
* drop some repetitionOscar Najera2023-01-241-12/+9
|
* Complete Advent of code day 25 lispOscar Najera2023-01-243-0/+172
|
* Clean up, heretic use of mutationOscar Najera2023-01-241-57/+68
|
* Day 24Oscar Najera2023-01-243-0/+161
|
* Day 23Oscar Najera2023-01-233-0/+171
|
* Clean up a bitOscar Najera2023-01-231-80/+48
|
* Solved day 22 part 2Oscar Najera2023-01-161-35/+96
| | | | This looks horrible and solution path is hard coded
* some simplificationOscar Najera2023-01-161-6/+6
|
* cross between faces as composed transformationOscar Najera2023-01-161-34/+54
| | | | | This is instead of determining manually the transformations can be deduced visually from the way the field composes.
* walk cubeOscar Najera2023-01-151-25/+49
|
* solve part2 exampleOscar Najera2023-01-151-27/+37
| | | | Realize I can have an arbitrary cube
* moving on cube surfaceOscar Najera2023-01-151-126/+114
|
* track facesOscar Najera2023-01-151-1/+124
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 13:02:18 +0000