Mark

If you are streaming or doing demos in your @OmarchyLinux system and want to show your keystrokes, try out my plugin. Keystrokes are never saved and you can protect secrets by excluding window classes, sudo and pkexec. install it at: plugins.omarchy.org/plugin.h… Have fun1

Inpired by the awesome #neovim plugin harpoon by @ThePrimeagen my AI minions built Harpoon for @OmarchyLinux ... Bookmark up too 10 Hyprland Windows and swap them in and out quickly without leaving your workspace. Have fun! 🔗🔗🔗 marketplace: plugins.omarchy.org/plugin.h… source: github.com/mpriem/omarchy-ha… inspired by: github.com/ThePrimeagen/harp…

I’m having so much fun with #omarchy! Thanks @dhh and the team for this great distro. Not since my first BASIC “Hello, world!” has a PC been this fun. This rice is fully plugin-based, built by agents in 2 days—even the recording is agent-driven. What a time to be alive!!

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

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.

I've completed Part One of "Movie Theater" - Day 9 - Advent of Code 2025 adventofcode.com/2025/day/9 #AdventOfCode I do not get what is being asked in part2. Will revisit tomorrow.

So in todays #AdventOfCode #Day8 union find or disjoint set data structures were the key ingredient: grokipedia.com/page/Disjoint… 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.

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. adventofcode.com/2025/day/8 #AdventOfCode

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. adventofcode.com/2025/day/7 #AdventOfCode

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. adventofcode.com/2025/day/6 #AdventOfCode

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? adventofcode.com/2025/day/5 #AdventOfCode

As I mentioned yesterday day 3's #AdventOfCode can be solved using a classic trick called a Monotonic Stack. Instead of scanning parts of the string repeatedly like I was doing, you want to scan the string only once and ensure only the biggest numbers stay and removing smaller "neighbors" left from the current character. a Monotonic Stack can do that. For example if you have 261121 and need to get the biggest 2 digit number without being allowed to reorder. You know you can remove 4 (K=4 aka Remove K Digits). 2 => First number. Push 2. (Stack: [2]) => K=4 6 => 6 > 2. Pop 2, Push 6. (Stack: [6]) => K=3 1 => 1 < 6. Push 1. (Stack: [6, 1]) => K=3 1 => 1 == 1. Push 1. (Stack: [6, 1, 1]) => K=3 2 => 2 > 1, 2 > 1. Pop 1, Pop 1, Push 2. Stack: [6, 2]) => K=1 1 => 1 < 6. Push 1. Stack: [6, 2, 1]) => K=1 We ran out of string and we have K=1 left so we K*Pop 🤡, and the resulting stack is [6, 2]. The largest possible combination of 2 characters is therefore 62 and we only scanned the string once. Happy #Coding !

I completed "Printing Department" on Day 4 adventofcode.com/2025/day/4 #AdventOfCode Last year on day 6 I learned about complex number math. Today that was super useful. Easy peasy!! adventofcode.com/2024/day/6

Ok, it’s officially time to familiarise myself with algorithms and common software problems more. Apparently Day 3 part 2 was a classic Remove K Digits problem… instead of banging my head against it for over two hours, I could have spend that time learning about monotonic stacks and greedy algorithms #AdventOfCode

Day 3 "Lobby" is done! Today C# was on the menu. Part 2 was quite the head-scratcher. adventofcode.com/2025/day/3 #AdventOfCode

Day 2 "Giftshop" is a wrap. This was a fun exercise. I went down the string comparison route. Regex hurts my brain to much 😅 adventofcode.com/2025/day/2 #AdventOfCode

That was a fun day 1. adventofcode.com/2025/day/1 #AdventOfCode I know it can be much cleaner, but I couldn't figure it out. how to cleanly deal with those ending or starting on zero situations??