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🔥🔥🔥

Starcraft in 30-40 mins , this time should not lag

Started

https://www.youtube.com/live/utaBb4omqEQ?si=I1peShdm7yfi0VIt

https://www.twitch.tv/andreyka26_?tt_content=channel&tt_medium=mobile_web_share

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

Early daily

Daily



https://leetcode.com/problems/range-product-queries-of-powers/description/?envType=daily-question&envId=2025-08-11

#daily

Decided to take a nap in the office for fun, never did it

Monday motivation

I guess you might remember demo for Doom 1 or something like that, where AI was generating the next frame?
My friend just shared the Minecraft AI version
https://youtube.com/shorts/ZbaxA5r4k2k?si=pg34NcG4tZU3p6QI

Daily.

Today is DP!!

https://leetcode.com/problems/ways-to-express-an-integer-as-sum-of-powers/description/?envType=daily-question&envId=2025-08-12

Hint: uniqueness is ensured same way like when you are generating the combinations in this problem: https://leetcode.com/problems/combinations/description/

#daily

I wanted to discuss one thing, about time complexity analysis

SPOILER
SPOILER
SPOILER
SPOILER
SPOILER
SPOILER
SPOILER
SPOILER

Do you see the difference between these 2 DP functions?

I'm a bit БОМБЛЮ because, I have seen a lot of similar problem analysis when authors would name both of these as O(2^n).

FUCK NO. these are different complexities, and today's daily proves it, you can submit it as comb2 and you'll get Time Limit Exceeded.

Without memoization the complexities:

comb time complexity O(2^n), as 2 decisions only

comb2 time complexity is approximately O(n/2 * 2^n) => O(n* 2^n), as on every next call we are doing n - k calls. It will approximate to n / 2, a bit hard to analyse but definitely not pure 2^n

top down/bottom up solutions

Follow up

knapsack 0/1 space optimization, converting DP 2D to DP 1D

This feeling of merging PR that was open for 2 weeks😤🤤

Today's daily is chill one, easy:

Brute force will fit.

https://leetcode.com/problems/power-of-three/?envType=daily-question&envId=2025-08-13

#daily

Follow up in constant time O(1).

We take the maximum possible power of 3 num in the constraints `n <= 2^31 - 1`.
And then if number is positive - check if the reminder will be zero

If you have only 1 run, then, yeah, you might calculate all power of 3, put them to map, and then in constant time chech if n is in map

At MS at my project, we are trying to stick to Scrum, but in reality it is something hybrid.
So, we usually don't have any estimations, if we do - these estimations on big features, and they are estimated in weeks. A lot of work load so a lot of reprioritization.

I was just checking my tasks, some of them were very old, and this is the outcome
- some repair item to fix the pipeline -> we migrated to new pipeline, so it is autoclosed
- some cleanup for skype related migration -> skype is done, so autoclosed,
...

I like how big corpo works xDD I closed a lot of shit by doing really nothing today

Got this recommendation, omg Eloy is legend:
https://youtu.be/3dD_8ztcwto?t=148