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

Claude Sonnet 4. Agent mode. Asked it to cover the class with test cases. FYI: there is no single place in our code base where we do for loop for single iteration

Today daily is dp + probabilities. I'm not big fun of probabilities, but here they are simple

https://leetcode.com/problems/soup-servings/description/?envType=daily-question&envId=2025-08-08

#daily

Hints.

Hint2: On every recursion, try 4 choices of pouring and sum them and add multiplication by 1/4 (as we have equal probability of choosing any of 4)

return 0.25 * (option1 + option2 + option3 + option4)

Hint 3: you gonna have only 2 variable in recursion, so this can be 2 Dimensional DP

Solution top down and bottom up DP

Me, pretending I missed notification and don't see message "could you pls review that pr"

Personal assistant is here

Have you heard about this one?
https://en.wikipedia.org/wiki/Rendezvous_hashing

It is so nice, I would say might be preferred option instead of consistent hashing.

Actually we can write POC during the stream

Starcraft 2 stream in 1-1.5 hours?
thumbup or thumbdown

Sorry, on working pc it just cannot handle obs and starcraft(( we will stream on Monday

Streaming today is 50/50. It will be shifted in case I cannot make it today's evening.

Topic - I want to cover sharding topic fully. So next streams for system design section we are reviewing how sharding works in different storages, and gonna implement POCs for each of the type🔥🔥🔥