andreyka26_se
610 subscribers
566 photos
66 videos
2 files
284 links
Hey, I'm software engineer at Microsoft, with 7 years of experience. Here we are talking about F(M)AANG big tech interviews: leetcode, system design and corpo life.

YouTube: @andreyka26_se
Instagram: andreyka26_se
TikTok: @andreyka26__
Download Telegram
Daily


Don't read if you solved yesterday's daily. It is exactly the same, except n^3 will not work here due to constraints, thus labeled as hard.

https://leetcode.com/problems/find-the-number-of-ways-to-place-people-ii/description/?envType=daily-question&envId=2025-09-03
Solution

Hint1: try sorting.
Hint2: the solution should be O(n^2)

Hint3: sort by x asc and then by y desc. Basically you can observe that next x is always bigger or same as previous. Now whenever previous y was higher than current y - you cannot count it as previous y for sure will be inside the rectangle.


===

Didn't come up with it on my own. Had to see the solution. In a nutshell, as per last hint, we just track change of Y between current and previous. If current is higher we count one. This way we make sure there is no point inside the rectangle
extremely good advice would be (for job security) - go and start working on some OOOOOLLLD legacy, that brings money, and literally not replaceable. You will never be replaced. You can only be laid off, or dropped in case project got replacement and stopped bringing money
8
andreyka26_se
extremely good advice would be (for job security) - go and start working on some OOOOOLLLD legacy, that brings money, and literally not replaceable. You will never be replaced. You can only be laid off, or dropped in case project got replacement and stopped…
Or, spend time on grinding your interview skill (leetcode, system design, intw questions), to feel extra confident and know that even in case of drop, in 1 month, you will find something else.
8
Airport leetcode once more
Daily

Today leetcode is a joke. Literally problem for 40 seconds. Go and collect the coin.


https://leetcode.com/problems/find-closest-person/description/?envType=daily-question&envId=2025-09-04
Solution: just measure absolute distance and return the one which is less
👍2
I added different structure for daily leetcode questions. Now answer with hints will be in comment section instead of separate post. Hope it will make things clearer. I'm 100% sure, maybe 1% of you are doing it with me, but at least for this 1% it will be extra motivation and competitive feeling (this guy did it today, I can do it as well)
10
Just realized I'm 25.... wtf is this, I feel like maybe 19-20 still
😁10🔥1
Daily

Bruteforce - quite easy, but we need something better than O(n*m)
Optimized - might be a bit hard

https://leetcode.com/problems/minimum-operations-to-make-array-elements-zero/?envType=daily-question&envId=2025-09-06
👍4
Tomorrow we are streaming during the day: 14-16 UTC + 2
Implementing Redis Sharding POC (basically emulating real redis)
👍5
Today let's play Starcraft2. In 2-4 hours
2