https://www.youtube.com/watch?v=attOfOeUMfI&ab_channel=andreyka26_se

https://www.twitch.tv/andreyka26_


Gogogo lets farm mmr

Diamond 3 is back here

okay, it was 1 time thing. Next time we gonna have again leetcode + system design streams. So don't worry

Daily. Description is shit, but translates to "Find out the longest length of subarrays with at most 2 different numbers". Nice and cool problem for Sliding Window pattern

https://leetcode.com/problems/fruit-into-baskets/description/?envType=daily-question&envId=2025-08-04

Lately I joined the Leetcode / FAANG ukrainian chats. And fuck, they are beasts. They just shared their leetcode daily streaks. WHO ARE THESE PEOPLE?

just for reference, here is mine

wish everyone peaceful week like this pic

Found this imba in the office. COME TO PAPA

Okay. Since we got a lot of people, what do u think about streaming before weekend, like tomorrow. We can talk, I can introduce myself, solve a bit leetcode, and system design tomorrow ?

I would appreciate tiktok and instagram subs in case u are there. I am posting there as well:

https://www.tiktok.com/@andreyka26__?_t=ZN-8ybjA0LfHJm&_r=1

https://www.instagram.com/andreyka26_se?igsh=YWdtNXl2OHk1NnJy&utm_source=qr

https://leetcode.com/problems/fruits-into-baskets-ii/description/?envType=daily-question&envId=2025-08-05

Spent around 30 mins to think about something better than O(N^2), and then realized, this is basically the best we can do here

#daily

fuck my life, something big might come, it might turn out that these 375 are not worthless, and actually they did their job😎

But now too early to say

Today's stream topic: DP.
Talking about recursive bruteforce, noticing subproblem pattern, top down memoization -> converting to bottom up -> putting memory optimization on top.

I remember DP was one of the most difficult topics on leetcode when I just was starting

recently we had leadership visiting Prague office.

Snacks after their leave:

I guess in 2 hours +- we gonna start the stream

Starting in 10 mins

Thanks everyone for the stream. Recording is there. If you struggle with Dynamic Programming thing - we discussed how to solve these type of problems + discussed consistent hashing and sharding in general, e.g. why hash(key) % instances is bad

You know, I think I got the meaning. I am 25, half of me is already in crisis of middle age. But I just got one thing:
Happiness, is when you have these 15 eur to order sushi, so you have a bit of dinner, and then you perform big impact and lay down. While you are trying to fall asleep - you realise: “fuck Im hungry”. Then you go get your sushi that you left finish them, make yourself sandwich on top, and eat it. This is it, THE MEANING.

© poor MS engineer from nowhere

Today's daily:
https://leetcode.com/problems/fruits-into-baskets-iii/description/?envType=daily-question&envId=2025-08-06

same as yesterday's, but O(n^2) will give you TLE. So you need to implement something smarter. Somebody mentioned segment tree yesterday, so you were right xDD

Hint1: first approach would be to think about splitting the basket somehow, with aggregated maxes(easy solution) Sqrt time complexity
Hint2: segment tree 💀💀💀(second, more optimized, but hard to implement) Log time complexity

#daily