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

again leadership visits, snacks:

Asked copilot to prove me that .net/c# linq .GroupBy() will retain the order within the group as in original sequence.

This guy has an ability to simulate .net test with python, I'm impressed a lot

I'm so happy that MS pays for this shit, not me

When you check Leetcode solution with some very “intuitive” recursive calls

Today's daily:
https://leetcode.com/problems/find-the-maximum-number-of-fruits-collected/description/?envType=daily-question&envId=2025-08-07

The reminder to carefully read the description. If you apply all the constraints from the problem there and aply basic logic + dp - it will be eas yto solve. I would say this one should be mid

#daily

Next video is hint to problem