aboutsummaryrefslogtreecommitdiffstats
path: root/AoC2023
Commit message (Collapse)AuthorAgeFilesLines
* refactoringOscar Najera2024-01-121-63/+47
|
* part2 day21Oscar Najera2024-01-121-0/+69
|
* [BUG FIX] LIFO Queue and visited map are adversaryOscar Najera2023-12-301-35/+35
| | | | | | | | The test for seen was steps-left independent. Yet the queue treats the last suggested place first. It happens than, that places reached by longer paths where not available when the sorter path options got a chance. Thus the visited controls now how many steps are left, and in the case of having more available, then the suggestion is taken.
* optimized diffusionOscar Najera2023-12-301-22/+31
|
* [AoC2023] day21 part 1 lispOscar Najera2023-12-293-0/+185
|
* refactorOscar Najera2023-12-291-34/+37
|
* part2Oscar Najera2023-12-291-2/+40
|
* [AoC2023] day20 lisp part1Oscar Najera2023-12-294-0/+159
|
* refactorOscar Najera2023-12-292-42/+41
|
* refactorHEADmasterOscar Najera2023-12-201-16/+21
|
* refactorOscar Najera2023-12-201-44/+38
|
* refactorOscar Najera2023-12-201-41/+32
|
* part2Oscar Najera2023-12-201-1/+85
|
* [AoC2023] day19 part 1 lispOscar Najera2023-12-203-0/+871
|
* [AoC2023] day18 lispOscar Najera2023-12-183-0/+796
|
* day01 juliaOscar Najera2023-12-181-0/+25
|
* day1 new regex trickOscar Najera2023-12-181-19/+13
|
* part 2Oscar Najera2023-12-181-16/+27
|
* cleanupOscar Najera2023-12-181-86/+33
|
* get sol day17Oscar Najera2023-12-173-0/+286
|
* solve with structsOscar Najera2023-12-171-0/+111
|
* part2Oscar Najera2023-12-171-13/+27
|
* [AoC2023] day16 lispOscar Najera2023-12-173-0/+213
|
* part2Oscar Najera2023-12-171-4/+33
|
* day15 part 1Oscar Najera2023-12-163-2/+26
|
* day14 but rock rolling is string sortingOscar Najera2023-12-161-0/+72
|
* solution part2Oscar Najera2023-12-162-76/+106
|
* refactor single slideOscar Najera2023-12-161-25/+20
|
* full spinOscar Najera2023-12-161-12/+58
|
* [AoC2023] day14 part1Oscar Najera2023-12-163-0/+145
|
* part2Oscar Najera2023-12-161-38/+47
|
* day13Oscar Najera2023-12-163-0/+1507
|
* solve part 2 with cacheOscar Najera2023-12-152-34/+1048
|
* [AoC2023] day12 part1 lispOscar Najera2023-12-151-26/+46
|
* aoc day12 first draftOscar Najera2023-12-151-0/+40
|
* part 2, off by one errorOscar Najera2023-12-141-11/+16
|
* [AoC2023] day11 part 1 lispOscar Najera2023-12-142-0/+206
|
* for loop rewriteOscar Najera2023-12-141-7/+6
|
* 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
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-24 10:41:26 +0000