Advent of Code 2022 solutions.
Go to file
felixm bac2144c17 Solve day 25 and AoC 2022. Cool. 2024-01-13 13:21:19 -05:00
.gitignore Solve day 17. 2023-12-28 15:31:53 -05:00
LICENSE Add license. 2023-12-04 10:14:30 -05:00
README.md Solve day 25 and AoC 2022. Cool. 2024-01-13 13:21:19 -05:00
d1.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
d2.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
d3.py Do day 3. 2023-12-03 18:20:02 -05:00
d4.py Do till day 5. 2023-12-03 18:44:22 -05:00
d5.py Do till day 5. 2023-12-03 18:44:22 -05:00
d6.py Do day 6. 2023-12-04 22:53:29 -05:00
d7.py Days 7, 8, 9. 9 was fun. 2023-12-06 21:12:59 -05:00
d8.py Days 7, 8, 9. 9 was fun. 2023-12-06 21:12:59 -05:00
d9.py Days 7, 8, 9. 9 was fun. 2023-12-06 21:12:59 -05:00
d10.py Day 10. 2023-12-06 21:41:22 -05:00
d11.py Day 11, 12, 13. 2023-12-07 23:57:09 -05:00
d12.py Day 11, 12, 13. 2023-12-07 23:57:09 -05:00
d13.py Day 11, 12, 13. 2023-12-07 23:57:09 -05:00
d14.py Do day 14 and 15. 2023-12-09 09:56:22 -05:00
d15.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
d16.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
d17.py Solve day 17. 2023-12-28 15:31:53 -05:00
d18.py Solve day 18. 2023-12-30 12:10:52 -05:00
d19.py Non hands-free solve of d22. 2024-01-11 19:55:35 -05:00
d20.py Implement days 20 and 21. 2024-01-09 18:43:27 -05:00
d21.py Implement days 20 and 21. 2024-01-09 18:43:27 -05:00
d22.py Non hands-free solve of d22. 2024-01-11 19:55:35 -05:00
d23.py Solve day 23. 2024-01-12 19:59:09 -05:00
d24.py Solve day 24 and update readme. 2024-01-13 11:24:00 -05:00
d25.py Solve day 25 and AoC 2022. Cool. 2024-01-13 13:21:19 -05:00
dx.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
get.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
lib.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00
monitor.py Use new AoC infrastructure and clean up. 2023-12-27 22:02:59 -05:00

README.md

Done with this. Overall everything is solvable. It's more about consistency and focus. Of course, learning more algorithms and techniques helps.

Possible to-dos:

  • Optimize day 19 because it is terrible.

Times (and comments)

  • Day 1: 7:52 ... so slow brah :/ top 100 required 2:05...
  • Day 2: 22:30 ... I mistyped the first and second was just bad top 100 would have been 6:16 (doable?)
  • Day 3: 13:08 actually decent but top 100 required 5:24
  • Day 4: 7:08 but top 100 required 3:33 still okay
  • Day 5: 11:56 but 7:58 for top 100... getting better?
  • Day 6: 3:50 but 2:25 for leaderboard :D
  • Day 7: 27:55 and 14:47 for leaderboard; okay, I would say
  • Day 8: 61:00 and 10:00 for leaderboard; I need template code for searching coordinate systems
  • Day 9: 58:00 and 7:32 for leaderboard; I need code for 2D stuff
  • Day 10: 25:20 and 12:17 for leaderboard; okay, okay
  • Day 11: 45:00 and 18:00 for leaderboard; arg, it was doable man
  • Day 12: 39:45 and 9:46 for leaderboard; the people are ready for their searches :D
  • Day 13: 44:00 and 12:56 for leaderboard; these people are just good, seriously
  • Day 14: 35:00 and 14:54; I just have to get that much quicker... 2D code!
  • Day 15: 150:00 and 27:00; I didn't use Manhattan dist initially, lot's of debugging
  • Day 16: 52:00 and 64:00; ARE YOU SAYING I WOULD HAVE MADE THE LEADERBOARD?!?!?!?!?!?!?!
  • Day 17: Second one was fun with having to detect the repetition.
  • Day 18: 12:00 and 32:00; really straightforward and of course way too slow.
  • Day 19: Slow.
  • Day 20: Struggled way too much.
  • Day 21: Straightforward and relatively fast.
  • Day 22: Very hard and wasn't able to do hands free. Even the best guys took over an hour.
  • Day 23: Super straightforward, but took me way longer than it should have because I loose focus and make silly errors. Like back in Middleschool.
  • Day 24: Easy. Should have been faster, but no crazy mistakes. Still way too slow for something easy like this.
  • Day 25: Quickly solved via constraint solver. Actual solution much simpler. Don't know if I would have been able to figure it out.