Comparing to X ahahah, greedy Musk wants me to pay for blue check box (it aint happening)

Daily (269/373 streak until LC cap)

Is it nostalgia week?))
Solid problem, but a bit annoying, they might have done it much more interesting, check the comments I will explain.

https://leetcode.com/problems/rotate-list/description/?envType=daily-question&envId=2026-05-05

#daily #medium #pattern

Daily (270/373 streak until LC cap)

Not bad problem, not hard, but no specific pattern eaither.

https://leetcode.com/problems/rotating-the-box/description/?envType=daily-question&envId=2026-05-06

#daily #medium #nopattern

Daily (271/373 streak until LC cap)

For me it was hard problem, from intuition standpoint. Didn't get the right one, until looked at the solution, but problem does not seem to be a bullshit.

https://leetcode.com/problems/jump-game-ix/description/?envType=daily-question&envId=2026-05-07

#daily #medium #pattern

When my MS colleagues are asking how am I doing at Snowflake.
…😆😆

Disclaimer: the post is only for humour purposes, nothing in common with reality

Daily (272/373 streak until LC cap)

This is yesterday's daily, as I needed to learn new concept and understand solution well, as it is for "staff", it is not bullshit mostly, and it has multiple very useful patterns.

https://leetcode.com/problems/minimum-jumps-to-reach-end-via-prime-teleportation/description/?envType=daily-question&envId=2026-05-09

#daily #medium #pattern

Sieve of Eraosthenes.

I have seen many problems on the Leetcode that require some work with prime numbers, either generating a lot of them, and checking whether some number is prime or not

Prime numbers are heavily used in encryption and hashing due to such math properties. So the usage is not only leetcode.

Prime number - is the number that is divided by itself and one without reminder. 0 and 1 are not prime numbers (proven by contradiction). Examples: 2,3,5,7,11,13,17,19...

===

The method, you can naively generate prime numbers up to N using O(n * sqrt(n)) by checking all possible factors. But the Sieve of Eratosthenes is much faster, close to linear O(log(logn))

For your understanding: log(log(10^9)) = 3.03

Check the comments and save this pattern to recall before the interview!

Just reminder - I always read all the comments and react to them.

So you have real power to affect/influence the future content a lot.

I have added tags a bit, so it is easier to search for you. Will do separate post and pin it.

System design / Tech
#systemdesign #network #security #auth

Live
#bigtech #healthcare

Leetcode
#daily #pattern #nopattern #recommend

Daily (273/373 streak until LC cap)

Dumb and irritating question. I hate this matrix shit when you need to struggle with these boundaries and indices. Don't recommend, however it is very straight forward.

https://leetcode.com/problems/cyclically-rotating-a-grid/submissions/1999151788/?envType=daily-question&envId=2026-05-09

#daily #medium #nopattern

Today is amazing sunny day in Dublin.
But I am oncall🥲
Not that I would go out even if I am not oncall, but still😆

Not a marketing, I'm not making money out of any my public resources/websites/apps, just can be useful as it was for me if you are working with network/traffic or you are SRE

Everyone can do it within 10-20 mins, but in case you don't want to spend claude tokens on it, here you go: https://tools.andreyka26.com/ip-checker

Daily (274/373 streak until LC cap)

Good reminder for DP pattern, not hard tbh, go and collect the coin.

https://leetcode.com/problems/maximum-number-of-jumps-to-reach-the-last-index/description/?envType=daily-question&envId=2026-05-10

#daily #medium

Daily (275/373 streak until LC cap)

Easy problem without any pattern pretty much. Go and collect the coin it is 2 minutes problem

https://leetcode.com/problems/separate-the-digits-in-an-array/description/?envType=daily-question&envId=2026-05-11

#daily #easy #nopattern

Let me share the pain, and tell you HOW NOT to do software engineering.

Skill number1 you should have over your service: being able to quickly understand that some specific merge to master/main is in some deployment or no.

Typical application: you merged some fix pr that changes behaviour, you have 20+ deployments that are deployed incrementally, and you want to know whether this specific fix is in the deployment you are interested in (lets say some oncall has paged you and moved to bridge call asking this q).

Usually you have 2 things:
- metric that reports version per deployment
- tag WITH THIS version on the main branch that represents the state of code that got deployed.
These 2 MUST be easily correlated. So version on the dashboard and version on the tag must be either the same or easily derivable.

Now imagine, somebody created a service, that has version coming hell knows from where, git tags that contain completely different numbers and words comparing to version in dashboard, and here you go: some guy is asking you: can we check this thing is deployed to region X?

Guess how much time I spent to confirm it?
Did I confirm 100% in the end?
I as AI successful in helping answer these questions(has access to docs and git)?
🤡🤡🤡🤡🤡

I’ll be honest, sometimes I feel warm nostalgic feeling to Epam and other outsource companies. Maybe I was lucky, but typically I had so small projects that I could have context ABOUT WHOLE project at a time.
You know everything e2e, you have FULL mental model in your mind.

I didnt have this feeling for 5 years now😆

Daily (276/373 streak until LC cap)

The easiest "hard" problem implementation I have ever seen. Good problem, a bit hard to come up with intuition: check discussion tab.

My advice: try to think greedy: which task to process the first and what you want to have as the first task

https://leetcode.com/problems/minimum-initial-energy-to-finish-tasks/description/?envType=daily-question&envId=2026-05-12

#daily #hard #nopattern