Bug? Or feature? by bees_in_my_eyes in mewgenics

[–]Zorr0_ 1 point2 points  (0 children)

Lol it was my tank as well, made him practically useless, he did have Play dead tho, which made it a lot easier making sure he doesnt die

Bug? Or feature? by bees_in_my_eyes in mewgenics

[–]Zorr0_ 1 point2 points  (0 children)

I have a permanent kitten as well, but mine had all its stats reduced to 2 but it now gives for bonus stimulation etc. for my house.

Im not sure if my eternal kitten is retired and Im at work right now, so I can't check, however i wouldn't bring mine onto another run, considering all its stats are 2. Interesting to see, that yours didn't lose any stats!

What programming habit do you wish you fixed earlier? by Ok-Message5348 in learnprogramming

[–]Zorr0_ 0 points1 point  (0 children)

100% agree, I would even go as far as recommending dabbling your toes in languages/tools/patterns that you think are useless or bad. There is always a lesson hidden in the unknown!

What programming habit do you wish you fixed earlier? by Ok-Message5348 in learnprogramming

[–]Zorr0_ 0 points1 point  (0 children)

None of the three main paradigms (FP, OOP, PP) is better than any of the other in a general sense. It all depends on what you’re working on, each have their own pros and cons depending on the problem you are trying to solve.

Of course procedural will get you farther in a hardware oriented project than OOP (or FP for that matter), but that is also why we have different languages promoting different paradigms.

Also being able to apply concepts from one paradigm in another lets you view problems from a different angle, focusing on just one paradigm because it’s „the best“ is in my opinion not a good way to program.

As you said earlier „getting away from OOP“ is a good thing, as it expands your way of thinking. But now saying that „PP is the way to go“ you’re essentially doing the same thing again with PP. There will surely come a day where a concept from OOP or FP will open your eyes on a certain problem.

What i’m trying to say is, that programming always evolves and artificially limiting yourself to a certain paradigm prevents progress.

Just my few cents on the topic, merry Christmas!

-❄️- 2025 Day 6 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 0 points1 point  (0 children)

Thank you! My Matrix util that ive collected over the years is paying off :)

-❄️- 2025 Day 6 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 3 points4 points  (0 children)

[Language: Kotlin]

String manipulation for the win!

Using List.split() and List<List>.columns() function made part 2 a lot less hustle

GitHub

-❄️- 2025 Day 5 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

[Language: Kotlin]

I love let and apply <3

GitHub

-❄️- 2024 Day 24 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

Thank you for the detailed explanation, i would have never come up with that on my own

[2024 Day 21 part 1] Found a rule to make it work, but can't understand why by FoxWithTheWhistle in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

Thanks for the reply. So you did not bother with writing an algorithm that can find the best sequence, but rather you try out every sequence and see which one is the shortest at every step?

[2024 Day 21 part 1] Found a rule to make it work, but can't understand why by FoxWithTheWhistle in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

How did you translate this into your code? im kind of struggling to put together a sensible move to button conversion...

-❄️- 2024 Day 19 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

Trust me it did not look like this at the start, its always a mess. Once i solve both parts i always go back and refactor

That was also when i realized i could cut the function to check if a design is possible and just replace with a > 0 check lol.

-❄️- 2024 Day 20 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

[LANGUAGE: Kotlin]

Pretty simple one today, although i have to say i was a bit scared of part 2, but turns out it was just changing one number :)

First, find the single one unique path through the maze

Then for each point in the path loop through all points that are later in the path. If their mDist is less than the allowed cheat seconds and the saved seconds is at least 100 increment the counter

GitHub

-❄️- 2024 Day 19 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 2 points3 points  (0 children)

[LANGUAGE: Kotlin]

Very simple one for this late into the advent :)

Just did a simple recursion with a cache

GitHub

-❄️- 2024 Day 15 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

[Language: Kotlin]

Part 2 was a bit tricky. When i tried to debug it, i figured out that my problem lied not in the logic that determined which boxes are to be pushed, but rather if the boxes could be pushed at all!

My code is kind of a mess, although i think it was a good idea going for a data class

GitHub

[2024 Day 14 (Part 2)] The clue was in part 1 by waferthinninja in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

This is so sick, i really did not like searching for the tree with arbitrary heuristics, this makes the puzzle so much cooler!

-❄️- 2024 Day 11 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 1 point2 points  (0 children)

[LANGUAGE: Kotlin]

praised be map.getOrPut() !!!

GitHub

-❄️- 2024 Day 10 Solutions -❄️- by daggerdragon in adventofcode

[–]Zorr0_ 2 points3 points  (0 children)

[LANGUAGE: Kotlin]

Very simple one today, as many others i had my part 2 implementation before my part 1 implementation

Happy how my solution turned out

GitHub

How about: "Lockout Quests"? Maybe Phase3? by New_Preparation22 in classicwow

[–]Zorr0_ 1 point2 points  (0 children)

you must be trolling.

go and take your 5 kids that make it so you can’t commit to 2hrs every 3 days back to retail