Daily 395th day
Easy one, and quick.
But no pattern
https://leetcode.com/problems/count-commas-in-range/?envType=daily-question&envId=2026-09-09
#daily #easy #nopattern
Easy one, and quick.
But no pattern
https://leetcode.com/problems/count-commas-in-range/?envType=daily-question&envId=2026-09-09
#daily #easy #nopattern
❤3
Daily 396th day streak
Can be solved similar way as prev one. No pattern though.
https://leetcode.com/problems/count-commas-in-range-ii/description/?envType=daily-question&envId=2026-09-09
#daily #medium #nopattern
Can be solved similar way as prev one. No pattern though.
https://leetcode.com/problems/count-commas-in-range-ii/description/?envType=daily-question&envId=2026-09-09
#daily #medium #nopattern
🔥4
Daily 397th day streak
Amazing problem, about the trees, non-bullshit, highly recommended.
https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/?envType=daily-question&envId=2026-09-10
#daily #medium #pattern
Amazing problem, about the trees, non-bullshit, highly recommended.
https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/description/?envType=daily-question&envId=2026-09-10
#daily #medium #pattern
👍7
Nothing has happened so far. For now I will be finishing up the Prague -> Ireland article. This will be the next piece
Just for the sake of content: finished last "fancy" group boxing class. Next week fight camp starts (proper boxing classes). People gonna beat me 3 times a week till November, and yes, this is what I want now. Yes it will be brain damage, and good opportunity to do another MRI scan in few years hahahha.
Recently had sparring, and I don't know how it works, but the amount of euphoria after the sparring is unexplainably huge, even if you just got beaten. I got back to 15yo vibe: whileTrue: school, studying, gym, food/sleep
Just for the sake of content: finished last "fancy" group boxing class. Next week fight camp starts (proper boxing classes). People gonna beat me 3 times a week till November, and yes, this is what I want now. Yes it will be brain damage, and good opportunity to do another MRI scan in few years hahahha.
Recently had sparring, and I don't know how it works, but the amount of euphoria after the sparring is unexplainably huge, even if you just got beaten. I got back to 15yo vibe: whileTrue: school, studying, gym, food/sleep
❤1😁1
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.
❤1
Dijkstra requires the graph to be ...
Anonymous Quiz
28%
Directed only
6%
Undirected only
29%
Acyclic
37%
None of the above
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
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
❤3
andreyka26_se
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/21380316…
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
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
🔥5❤2
andreyka26_se
Dijkstra requires the graph to be ...
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.
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.
❤1
Dijkstra: How do you recover the path itself, not just its cost?
Anonymous Quiz
17%
Store the full path in each heap entry
68%
Keep prev[v], set it whenever dist[v] improves, then walk backwards from the target
9%
Re-run Dijkstra from the target
6%
Sort nodes by final dist and read them in order
❤1
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
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
❤2
andreyka26_se
Dijkstra: How do you recover the path itself, not just its cost?
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
The algo:
You have current_node and neighbour. Every time you find better path to neighbour (from current_node) you update
prev[neighbour] = curr.🔥3
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
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
❤2
andreyka26_se
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
https://live.andreyka26.com/czech-republic-to-ireland-relocation-as-software-engineer
#bigtech #healthcare #ireland
🔥14❤2
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
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
❤3