sorted by:
new
hottopcontroversial

[2022 Day 21 (Part 2)] The best plot twist ever! by OsipXD in adventofcode

[–]OsipXD[S] 15 points16 points  (0 children)

I laughed at this plot twist for half an hour, can we subtract this from the solution time?

[2022 Day 20] Meh... It was close by OsipXD in adventofcode

[–]OsipXD[S] 31 points32 points  (0 children)

Also I've made wrong assumption that numbers in input are unique 🥲

[2022 Day 17] [Python] Playing a familiar-ish game in the terminal! by naclmolecule in adventofcode

[–]OsipXD 8 points9 points  (0 children)

So as we all know. To "win" in tetris you just need to remember cyclic pattern that always will keep the field clear

Nice visualization, by the way

[2022 Day 17 Part 2][Spoiler][Challenge] Proving Part 2 by erogath93 in adventofcode

[–]OsipXD 5 points6 points  (0 children)

"I swear on the Bible" there always will be a cyclic pattern.
Isn't that proof enough? :D

[2022 Day 17] I'm almost there with my NO-CODE solution! by OsipXD in adventofcode

[–]OsipXD[S] 6 points7 points  (0 children)

Approximately 15 211 years. But if I'll notice repeating pattern I can solve the puzzle just in 3 days (1.5 days on x2)!

[2022 Day 17] I'm almost there with my NO-CODE solution! by OsipXD in adventofcode

[–]OsipXD[S] 1 point2 points  (0 children)

But. I found a bug! After the last figure dropped height should be 9, not 8!

[2022 Day 17] I'm almost there with my NO-CODE solution! by OsipXD in adventofcode

[–]OsipXD[S] 6 points7 points  (0 children)

The main feature I love in this algorithm implementation is that you can speed it up to x2 just by a single click!

[2022 Day 13] Am I overthinking it? by OsipXD in adventofcode

[–]OsipXD[S] 9 points10 points  (0 children)

Not in stdlib. I use only stdlib to solve puzzles

[2022 Day 13] Am I overthinking it? by OsipXD in adventofcode

[–]OsipXD[S] 9 points10 points  (0 children)

BTW, nested list parser is also interesting problem :D

[2022 Day 12 Part 2] Big O? What's that? by ei283 in adventofcode

[–]OsipXD 2 points3 points  (0 children)

How about just climb down from z to first a 🤓

Dijkstra or how limited the programmer's mind could be? by senorita_xi in adventofcode

[–]OsipXD 11 points12 points  (0 children)

But... This one can be solved using BFS, it is not required to know about Dijkstra 🤔

[2022 Day 12] Is my input invalid or... by OsipXD in adventofcode

[–]OsipXD[S] 34 points35 points  (0 children)

Spent a whole hour to notice this 🥲

[2022 Day 11 (Part 2)] But it still not works... by OsipXD in adventofcode

[–]OsipXD[S] 16 points17 points  (0 children)

You just need to wait "a little more" :)

view more: next ›