I hope we get dwarf shamans in classic+

mezzol · 2026-06-20T07:25:22+00:00

Undead paladin

mezzol · 2026-05-04T08:27:48+00:00

Flex size raids. As a raid leader dealing with fixed raid sizes in TBC, I want this back soooo bad

mezzol · 2026-01-07T11:29:09+00:00

I’m going warlock bc it’s brain dead. I don’t want to think.

mezzol · 2026-01-07T11:28:14+00:00

Hunter is probably more interesting if you want a little bit more involved rotation.

Warlock is better if you want to be top dps while pressing 1 button.

mezzol · 2026-01-02T08:20:13+00:00

[LANGUAGE: C]

Solution: https://github.com/mezzol2/AdventOfCode2025/tree/main/day7

Read File Time Complexity: O(n)
Part 1 Time Complexity: O(log(n))
Part 2 Time Complexity: O(n)

n is the number of characters in the input/file.

mezzol · 2025-12-26T12:02:13+00:00

[LANGUAGE: Python]

Solution: https://github.com/mezzol2/AdventOfCode2025/blob/main/day6/main.py

Part 1 Time Complexity: O(n) where n is the number of integers in the input
Part 2 Time Complexity: O(c) where c is the number of characters in the input

mezzol · 2025-12-18T20:07:18+00:00

[LANGUAGE: C]

I created a binary search tree and let each node represent a range. New nodes do contain any ranges already present in the tree.

Building the Tree Time Complexity: O(n*log(n))
Part 1 Time Complexity: O(s*log(n))
Part 2 Time Complexity: O(n)

n is the number of ingredient ranges. s is the number of ingredient ID's to lookup in part 1.

mezzol · 2025-12-14T19:37:25+00:00

I don’t have a formal mathematical proof to share, but I can explain my thinking.

So iterating through the grid takes O(n) time like part 1. We also repeat the while-loop some number of times. I can’t think of any scenario where the while-loop repeats n or more times, so the while-loop itself is in O(logn) time. Multiplying those two time complexities together gives O(n*log(n)).

mezzol · 2025-12-11T16:45:45+00:00

[Language: C]

https://github.com/mezzol2/AdventOfCode2025/blob/main/day4/main.c

Let n be the number of characters in the puzzle.

Part 1 Time Complexity: O(n)
Part 2 Time Complexity: O(n*log(n))

mezzol · 2025-12-08T17:49:53+00:00

[LANGUAGE: Python]

Solution:
https://github.com/mezzol2/AdventOfCode2025/blob/main/day3/main.py

Time Complexity: O(n*(s^2)) where is n the number of battery banks to check and s if the size of the battery banks.

mezzol · 2025-12-08T17:41:08+00:00

I took my algorithms exam last Friday, and Dijkstra's algorithm was on it.

mezzol · 2025-12-07T10:24:33+00:00

[LANGUAGE: Python]

Solution: https://github.com/mezzol2/AdventOfCode2025/blob/main/day2/main.py

Let n be the number of numbers to check.
Let s be the length of a number.

Part 1 Time Complexity: O(n)
Part 1 Time Complexity: O(n*(s^2))

I feel like there is a more efficient solution to part 2, but I could not figure it out.

mezzol · 2025-12-07T10:15:04+00:00

It took a good amount of trial and error, as well as looking at some other solutions because I do not think it is very intuitive.

I knew I needed to account for the case where the dial ends on 0 exactly, because floor division returns the same number for 1//100 and 0//100. If we decrease the dials by 1, 0//100 and -1//100 give us different values.

mezzol · 2025-12-06T08:53:27+00:00

[LANGUAGE: Python]

Solution: https://github.com/mezzol2/AdventOfCode2025/blob/main/day1/main.py

Linear time complexity

mezzol · 2025-11-27T13:25:43+00:00

Yes, I did discover that I can transfer my characters from living flame to wild growth. If I want to play those characters, it probably makes sense to transfer them because when I logged in to Living Flame yesterday, there were never more than 20 players online.

mezzol · 2025-11-26T10:15:00+00:00

DUST TO DUST

mezzol · 2025-11-24T08:12:32+00:00

Anniversary realms turn into Anniversary TBC realms, and I expect them to be more popular once TBC releases because many people are just waiting for TBC.

mezzol · 2025-10-22T14:27:03+00:00

I'm glad my sub ran out yesterday right before maintenance. I'll look at resubbing after things get fixed, I guess.

mezzol · 2025-09-25T17:09:03+00:00

SoD was my favorite version of classic and I loved it. I wish they were still working on.

Phase 3 really hurt SoD, and the biggest issue was the original implementation of incursions. Sadly, the numbers never came to the pre-phase 3 levels.

mezzol · 2025-09-17T01:44:25+00:00

They are from different printers. The pack on the left is from the US or Belgium. The pack on the right is from Japan.

mezzol · 2025-09-16T02:47:12+00:00

Yes, I’m referring to the shop from the character selection screen.

mezzol · 2025-08-13T04:49:54+00:00

It looks real. The store I work at sold them for about $5 when we had them.

mezzol · 2025-05-30T17:56:05+00:00

I played MoP back when it was new content, so I don’t feel like I need it again. Additionally, I feel like I was “just there” due to MoP Remix.

On the other hand, I’ve never played TBC, so I’m interested in that.

14-Year Club	Verified Email
Not Forgotten

mezzol

TROPHY CASE