For now, what I only can say. Graph algos are VERY IMPORTANT. Just believe me. Let's check your knowledge for graph algos a bit. Just trust me, this is very important.

Daily 398th day streak

A bit bullshit problem tbh. There is some math solution, but no I'm not going to spend my 2 hours to implement it for easy problem 😁

No pattern though

https://leetcode.com/problems/unique-3-digit-even-numbers/submissions/2138031622/?envType=daily-question&envId=2026-09-11

#daily #easy #nopattern

Btw, respect, Ivan is always faster than ma ahahhah.

Now I have this competitive feeling to start exactly at 01:00 UTC+1 to be the first 😁😁

Subbing to each other actually works, at least for me

The right answer is "None of the above". Due to the nature of Dijkstra, it can run with cycles, directed or undirected, whatever.

Because Dijkstra runs in the following mental model. Every single node has "THE SHORTEST PATH YOU CAN GET TO THIS NODE". You update it only if you find something better: therefore you don't have to keep visited set for traversal, cycles work, cause you end up in the same position which you would skip as it will have longer path, etc.

The only thing that will make Dijkstra not working - is negative weights.

Exactly, this is one of the best explanations.

Having that, you might have the opposite situation: every new path decrease the path, and you try to find the biggest path(contrary to shortest). And Dijkstra will work

Daily 399th day streak

Hard one, but has pattern. However wasn't able to solve on my own tbh. Up to you (however I saw like 6 people has already solved it hahahah), respect folks!

https://leetcode.com/problems/maximum-score-of-non-overlapping-intervals/description/?envType=daily-question&envId=2026-09-12

#daily #hard #pattern

This one I remembered in critical moment, drum roll, from MIT lecture I watched in YouTube 5 years ago!!!

The algo:

You have current_node and neighbour. Every time you find better path to neighbour (from current_node) you update prev[neighbour] = curr.

Daily 400th day streak.

Matrix, as always - bullshit. do not recommend, no pattern. However basic bruteforce works here, so not that hard.

https://leetcode.com/problems/image-overlap/description/?envType=daily-question&envId=2026-09-13

#daily #medium #pattern

Today - drop of “Czech Republic - Ireland relocation”

Done. Hopefully it is useful. Feel free to share the feedback, questions, correction here or in the comments under the article.

https://live.andreyka26.com/czech-republic-to-ireland-relocation-as-software-engineer

#bigtech #healthcare #ireland

Daily 401st day streak

It was interesting problem, as I like geometry. I have heard this sort of question was asked during one of the interviews in big tech. It is bullshit, no pattern, but nice brain puzzle, not very hard.

https://leetcode.com/problems/rectangle-overlap/description/?envType=daily-question&envId=2026-09-14

#daily #easy #nopattern

I bet with friend at Snow I can do 50 push up.

First he bet 20 eur for slow ones. I said no, I cant do these, I am doing explosive and fast only, but complete ones.

He said 10 eur. I said I am not that cheap bitch.
So we agreed on 16.5 eur.

Now, the q: did I make it? Do I look like a guy who can do 50 push ups?

Exactly

For the future, my 50 pushups worth 16.5 eur

The one who put shit smile - okay, I can accept this. 50 is not something to be proud of.

The one who put a clown smile - leave this channel😁😁😁

All of the people here should already know that I am clown, there is no need to state such obvious things