How to best irritate half a billion humans on an daily basis. #microsoft #Outlook #microsoftoffice #office #userexperience #ux #uiux #office

Never knew trying out a new programming language could be this much fun 😀 codeberg.org/ziglings/exerc… Thanks Chris Boesch ⚡ ! Lets see if Zig suits me better than Rust.

YES! Let’s go! Can’t wait until the working day is over 🤩 adventofcode.com

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??

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

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

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

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

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

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

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.

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.

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

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

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.

Dear Microsoft, please just stop releasing and enabling Beta software in your stable release channels. Naming preview software “Frontier” is not fooling anyone.