Search
Feeds
Discover
Login
Debug
Fork on GitHub
See full post
M. Tarık Yurt
mtyurt.net
I just completed "Cafeteria" - Day 5 - Advent of Code 2025
#AdventOfCode
adventofcode.com/2025/day/5
Still going strong, I solved second part in o(n*n) complexity, not sure if there is a more efficient solution.
Day 5 - Advent of Code 2025
adventofcode.com
Dec 5, 2025 20:47
0
reposts
0
quotes
0
likes
Repost
Quote post
View on Bluesky
Copy Bluesky URL
Copy post URL
Translate post
Show all post labels
An unhandled error has occurred.
Reload
🗙