some-advent-of-code: Branch: master

HEAD

feat 21 08.2 solve constraintsNicholas Prado <nmprado@nzen.ws>Tue Dec 14 06:52:52 UTC 2021
chore 21 09 inputsNicholas Prado <nmprado@nzen.ws>Fri Dec 10 04:27:05 UTC 2021
feat 21 08.1 count substring of lengthNicholas Prado <nmprado@nzen.ws>Fri Dec 10 04:25:39 UTC 2021
chore 21 2.1 g: corrects filename to match dayNicholas Prado <nmprado@nzen.ws>Wed Dec 8 06:28:23 UTC 2021
feat 21 02.1 golang and templateNicholas Prado <nmprado@nzen.ws>Wed Dec 8 06:22:52 UTC 2021
feat 21 07 not actually least squaresNicholas Prado <nmprado@nzen.ws>Wed Dec 8 03:26:15 UTC 2021
feat 21 06 bucket fillingNicholas Prado <nmprado@nzen.ws>Wed Dec 8 03:22:54 UTC 2021
feat 21 05 map of intersectionsNicholas Prado <nmprado@nzen.ws>Mon Dec 6 01:34:47 UTC 2021
chore i700101 igore eclipse output folderNicholas Prado <nmprado@nzen.ws>Mon Dec 6 01:34:11 UTC 2021
feat 21 04 iterate over arrayNicholas Prado <nmprado@nzen.ws>Sat Dec 4 20:06:31 UTC 2021
feat 21 01.2 best of threeNicholas Prado <nmprado@nzen.ws>Sat Dec 4 06:35:57 UTC 2021
chore 21 offset answer with tabNicholas Prado <nmprado@nzen.ws>Sat Dec 4 06:34:15 UTC 2021
chore 21 01,02 provide solutionsNicholas Prado <nmprado@nzen.ws>Sat Dec 4 05:31:05 UTC 2021
feat 21 03.2 stepwise sum and discardNicholas Prado <nmprado@nzen.ws>Sat Dec 4 05:30:04 UTC 2021
feat 21 03.1 running total, calc binaryNicholas Prado <nmprado@nzen.ws>Sat Dec 4 05:24:18 UTC 2021
chore 21 template for simplicityNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:49:13 UTC 2021
feat 21 01.1 replace maxNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:48:37 UTC 2021
feat 21 02.2 aimNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:24:58 UTC 2021
fix 21 02.1 correct day input file namesNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:24:20 UTC 2021
feat 21 02.1 running totalNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:15:07 UTC 2021
checkin 20 07 moved intermediate work to year folderNicholas Prado <nmprado@nzen.ws>Fri Dec 3 02:01:11 UTC 2021
chore i700101 moved solved files to year foldersNicholas Prado <nmprado@nzen.ws>Tue Dec 8 06:30:37 UTC 2020
feat 2007 1 reverse adjacency matrixNicholas Prado <nmprado@nzen.ws>Tue Dec 8 06:23:55 UTC 2020
feat 20 06 sets and mapsNicholas Prado <nmprado@nzen.ws>Tue Dec 8 03:52:28 UTC 2020
feat 200502 set for missingNicholas Prado <nmprado@nzen.ws>Sun Dec 6 04:10:52 UTC 2020
feat 200501 just move the indiciesNicholas Prado <nmprado@nzen.ws>Sun Dec 6 03:54:46 UTC 2020
feat 200402 validates passportsNicholas Prado <nmprado@nzen.ws>Sat Dec 5 23:13:02 UTC 2020
chore 200402 distinguish first exampleNicholas Prado <nmprado@nzen.ws>Sat Dec 5 23:12:25 UTC 2020
feat 20 04 01 structNicholas Prado <nmprado@nzen.ws>Sat Dec 5 02:47:10 UTC 2020
feat 20 03 iterates over the original stringsNicholas Prado <nmprado@nzen.ws>Fri Dec 4 04:07:53 UTC 2020
feat 2002 parses linesNicholas Prado <nmprado@nzen.ws>Wed Dec 2 06:50:08 UTC 2020
chore 2001 clarify file is inputNicholas Prado <nmprado@nzen.ws>Wed Dec 2 06:49:05 UTC 2020
feat 20 01 1+2 solvedNicholas Prado <nmprado@nzen.ws>Tue Dec 1 07:10:46 UTC 2020
ignore hand compiled filesNicholas Prado <nmprado@nzen.ws>Thu Dec 5 07:58:37 UTC 2019
chore input for 1801; solution missingNicholas Prado <nmprado@nzen.ws>Tue Dec 3 09:32:14 UTC 2019
feat solves D3 p1Nicholas Prado <nmprado@nzen.ws>Tue Dec 3 09:24:08 UTC 2019
fix log class acronym includes the yearNicholas Prado <nmprado@nzen.ws>Tue Dec 3 06:16:15 UTC 2019
feat 191202_2 brute forces particular answerNicholas Prado <nmprado@nzen.ws>Tue Dec 3 05:32:17 UTC 2019
feat i191202 second day part oneNicholas Prado <nmprado@nzen.ws>Tue Dec 3 04:38:38 UTC 2019
Released as anti-drm licenseNicholas Prado <nmprado@nzen.ws>Mon Dec 2 04:35:22 UTC 2019
Solved day one of 2019Nicholas Prado <nmprado@nzen.ws>Mon Dec 2 04:16:02 UTC 2019
(181203,4) abortive day 3 first taskNicholas Prado <nmprado@nzen.ws>Mon Dec 2 04:10:30 UTC 2019
(181202) Second day, both tasksNicholas Prado <nmprado@nzen.ws>Mon Dec 2 04:03:28 UTC 2019


Generated by git2html.