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
https://leetcode.com/problems/soup-servings/description/?envType=daily-question&envId=2025-08-08
#daily
LeetCode
Soup Servings - LeetCode
Can you solve this real interview question? Soup Servings - You have two soups, A and B, each starting with n mL. On every turn, one of the following four serving operations is chosen at random, each with probability 0.25 independent of all previous turns:…
👍2
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
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
❤6
Sorry, on working pc it just cannot handle obs and starcraft(( we will stream on Monday
👍5
Daily
https://leetcode.com/problems/reordered-power-of-2/description/?envType=daily-question&envId=2025-08-10
Hint:check all power of 2, try to think how sorting might help here
#daily
https://leetcode.com/problems/reordered-power-of-2/description/?envType=daily-question&envId=2025-08-10
Hint:
#daily
🔥3
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🔥🔥🔥
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🔥🔥🔥
🔥8
I guess recording will be there , played a lot of games, not on diamond, but on plat level. But yea, we did stream, and it was not lagging that much
❤2
Solutions and hints:
hint1:to get the all powers of 2 that number consists of - you basically need to get it's binary represantation as this is how binary number works {for each index I in binary representation, the number can be got by SUM( VALUE[I] * 2 ^ I )}
for binary 1011 we get => (1 * 2 ^ 3) (0 * 2 ^ 2) + (1 * 2 ^ 1) + (1 * 2 ^ 0) = 8 + 0 + 2 + 1 = 11.
So first hint is how to get your array - just decompose it's binary representation
hint2:think about how large the array of your num can be, given 1 <= n <= 10^9. Recall 10^ 9 comparing to 2^32, and apply bruteforce.
hint1:
for binary 1011 we get => (1 * 2 ^ 3) (0 * 2 ^ 2) + (1 * 2 ^ 1) + (1 * 2 ^ 0) = 8 + 0 + 2 + 1 = 11.
So first hint is how to get your array - just decompose it's binary representation
hint2:
🔥2