Mark

Dad, boyfriend, nerd, engineer, gamer, gadgetfreak... in that order

[Mark @markpriem]

The company that could single handedly kill both #Windows and #MacOS market share is @Adobe. If only Creative Suite had a @Linux version…

[Mark @markpriem]

Whatever has changed @OpenAI @OpenAICodexCli with the way quotas are measured, it makes the Plus subscription useless for coding. I cannot even work on a single (albeit large) project with a single chat at a time without running out of tokens. This never used to be an issue and I’m not going to pay 200$ a month for working on personal projects. Going to try out @claudeai next.

[Mark @markpriem]

@levelsio I’m being told ten million times a day that you should just vibe code it. Easy! Software engineering is dead 🤡

[Mark @markpriem]

@exquizitely Great game! The sequel was even better. Forgot all about those. Thanks!

[Mark @markpriem]

@X how can I influence the video recommendations? My timeline is solely f1, tech and games, but every time I watch a video the next one that automatically starts is some tiktok slob. Nothing that remotely interests me…

[Mark @markpriem]

@exquizitely Mi2 100%

[Mark @markpriem]

@yoch3m @mitchellh @chrisbycreme +1 🙋‍♂️

[Mark @markpriem]

I've completed Part One of "Movie Theater" - Day 9 - Advent of Code 2025 https://t.co/laJoXoPB1V #AdventOfCode

I do not get what is being asked in part2. Will revisit tomorrow.

[Mark @markpriem]

So in todays #AdventOfCode #Day8 union find or disjoint set data structures were the key ingredient:
https://t.co/wPC8xkAINr

This type of data structure stores disjoint groupings of data and provides means to find and merge/join groups.

The find method below recursively finds the parent and the union method merges the groups (in this case just updates group sizes) and sets the new parents.

Super useful for today's puzzle.

[Mark @markpriem]

Ok, today I had to cheat. I was stuck at part 1. I had the vector distances sorted, but I couldn't find out how to build and manage the groups. I sent the problem to Gemini to ask what algorithm to use and he suggested to use a union find. I did not understand so he generated a helper class for me. After that, finishing part 1 and 2 were easy.

https://t.co/MZ9quZMyxu #AdventOfCode

[Mark @markpriem]

Today was a cool one! Part 1 tripped me up with the adjacent splitters for a while. Part 2 reminded me of Day 12 in 2023. Although not exactly the same, the challenge was similar in that you needed to find all possible combination using recursion and memoization.

https://t.co/X6GFX1ezRO #AdventOfCode

[Mark @markpriem]

@Ronald_vanLoon @mog_russEN If only 😂. Video generation is getting insanely good.

[Mark @markpriem]

@johnnieisle @yakwaxlips The Drifter was great!

[Mark @markpriem]

@davepl1968 What's soccer?

[Mark @markpriem]

Day 6 "Trash Compactor" done and dusted. Today I spend way to much time fighting the #zig compiler. It is nice to play around with these low level languages, but it makes little sense to use it on these types of puzzles.
Anways... Another one bites the dust.

https://t.co/YuI2a9intU #AdventOfCode

[Mark @markpriem]

@denicmarko Just because you can, doesn't mean you should 😉

Scene looks great though.

[Mark @markpriem]

@saykodere @onscreenlol Seriously underrated comment

[Mark @markpriem]

Today part 2 was a breeze as I had already merged the ranges in part 1. Also used a binary search in part 1, so I could brag about it here on X. 🧐

Man I love these little puzzles. Are there any other free events that I need to know about?

https://t.co/SukKvrtNLZ #AdventOfCode

[Mark @markpriem]

@davepl1968 🤡🤣