# I am the Watcher. I am your guide through this vast new twtiverse.
# 
# Usage:
#     https://watcher.sour.is/api/plain/users              View list of users and latest twt date.
#     https://watcher.sour.is/api/plain/twt                View all twts.
#     https://watcher.sour.is/api/plain/mentions?uri=:uri  View all mentions for uri.
#     https://watcher.sour.is/api/plain/conv/:hash         View all twts for a conversation subject.
# 
# Options:
#     uri     Filter to show a specific users twts.
#     offset  Start index for quey.
#     limit   Count of items to return (going back in time).
# 
# twt range = 1 21
# self = https://watcher.sour.is/conv/apnoyca
Day 3, Part 1 and Day 3, Part 2 of #AdventOfCode #2023 done πŸ₯³ -- My solution isn't very efficient though πŸ€¦β€β™‚οΈ But it'll do 🀣
Day 3, Part 1 and Day 3, Part 2 of #AdventOfCode #2023 done πŸ₯³ -- My solution isn't very efficient though πŸ€¦β€β™‚οΈ But it'll do 🀣
Day 3, Part 1 and Day 3, Part 2 of #AdventOfCode #2023 done πŸ₯³ -- My solution isn't very efficient though πŸ€¦β€β™‚οΈ But it'll do 🀣
@movq @taigrr again, I dunno how you both beat me 🀣 But well done! πŸ‘ Did I write too much code again? πŸ˜…
@movq @taigrr again, I dunno how you both beat me 🀣 But well done! πŸ‘ Did I write too much code again? πŸ˜…
@movq @taigrr again, I dunno how you both beat me 🀣 But well done! πŸ‘ Did I write too much code again? πŸ˜…
@prologic

> Did I write too much code again? πŸ˜…

I don’t know. πŸ˜… My solution is rather long as well:

https://www.uninformativ.de/git/advent-of-code/file/2023/day03/s.c.html

Still happily runs on DOS.
@prologic

> Did I write too much code again? πŸ˜…

I don’t know. πŸ˜… My solution is rather long as well:

https://www.uninformativ.de/git/advent-of-code/file/2023/day03/s.c.html

Still happily runs on DOS.
@prologic

> Did I write too much code again? πŸ˜…

I don’t know. πŸ˜… My solution is rather long as well:

https://www.uninformativ.de/git/advent-of-code/file/2023/day03/s.c.html

Still happily runs on DOS.
@movq Nice! πŸ‘Œ But you still beat me πŸ˜†
@movq Nice! πŸ‘Œ But you still beat me πŸ˜†
@movq Nice! πŸ‘Œ But you still beat me πŸ˜†
@movq Hah looks like your logic is quite similar to mine actually and we wrote similar amounts of lines of code πŸ€”
@movq Hah looks like your logic is quite similar to mine actually and we wrote similar amounts of lines of code πŸ€”
@movq Hah looks like your logic is quite similar to mine actually and we wrote similar amounts of lines of code πŸ€”
@prologic Yours is more clever and cleaner, I think. πŸ€” You were able to reuse more code for the second part. I, instead, wrote a different search logic for part 2. πŸ˜…
@prologic Yours is more clever and cleaner, I think. πŸ€” You were able to reuse more code for the second part. I, instead, wrote a different search logic for part 2. πŸ˜…
@prologic Yours is more clever and cleaner, I think. πŸ€” You were able to reuse more code for the second part. I, instead, wrote a different search logic for part 2. πŸ˜…
@movq Hah πŸ˜… Hmm πŸ€” Yeah all I had to do in the 2nd part was store the YX coordinate of the Symbol for the part, then transpose all the parts into a map of SymbolYX -> Part(s) Note that I call it YX and not XY because the usual way of dealing with this in code, is rows first, then columns, ro Y then X πŸ˜…
@movq Hah πŸ˜… Hmm πŸ€” Yeah all I had to do in the 2nd part was store the YX coordinate of the Symbol for the part, then transpose all the parts into a map of SymbolYX -> Part(s) Note that I call it YX and not XY because the usual way of dealing with this in code, is rows first, then columns, ro Y then X πŸ˜…
@movq Hah πŸ˜… Hmm πŸ€” Yeah all I had to do in the 2nd part was store the YX coordinate of the Symbol for the part, then transpose all the parts into a map of SymbolYX -> Part(s) Note that I call it YX and not XY because the usual way of dealing with this in code, is rows first, then columns, ro Y then X πŸ˜