this is TRUE prompt engineering xDD

Starcraft in 10 mins

Daily is deadly today

I had almost no idea how to solve it, so I just checked the solution after 20 mins. It is too much effort I guess.

If I'm getting this on the interview - I will not join the company 1000%

https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-ii/description/?envType=daily-question&envId=2025-08-23

#daily

Solution

Basically I will explain and draw the solution so at least you can understand it. Understanding the solution is also very useful skill.

We have 6 ways to split the area. Do you remember daily few days ago? Find the minimum area with 1's? So we are going to apply this algo in each of these sections.

Now what we need to do is try out all these sections, and find minimum area in each of them, and then run min(prev, currentlycalculated) over them as result to return

Visualization of how we split and try to calculate.

Then we rotate the grid and do it again.

In total you will get 6 such combinations of splitting, and just return the min out of them. Fuck it.

Have a nice day, and remember you need to balance and have your own life apart from leetcode

Daily

Easy one, go and collect the coin.

https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description/?envType=daily-question&envId=2025-08-24

#daily

Solution

It is sliding window, we should find the biggest contiguous subarray containing only `1`. We must drop at least 1 item.

So whenever we see zero - we drop it, and try to extend the subarray. When we have more than 1 zero in our subarray - we shrink window, until we used only one deletion.

Sorry, was doing system design consultations, so I solved the daily challenge the last 10 mins as well

Daily

Not hard one - go and collect the coin

https://leetcode.com/problems/diagonal-traverse/description/?envType=daily-question&envId=2025-08-25

#daily

Solution

not sure about right solution, mine is cumbersome - but correct.

Just getting all "diagonals" from bottom to up, and reversing them if we need to move them from up to down.

Love this view and sound

Sorry, I didnt disappear, a lot of stuff going on, we soon gonna stream about observability in distributed systems. And we will implement system design of observability metrics, millions or even billions metric fires per second

Daily

https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle/description/?envType=daily-question&envId=2025-08-26

Easy - go and collect the coin. 5 mins problem

I truly don't understand how come acceptance here is 42%, but on some dynamic programming optimization problem the rate might be 70% and you fucking have no idea even how to solve with bruteforce.
Leetcode is broken

#daily

Solution

Just apply Pythagorean theorem and find the longest diagonal.
If diagonals are the same - then pick the biggest area

gl hf gg

Fucking a lot of fun

The assessment is basically hard leetcode question. Involved coordinates and angles between points on coordinates system. Tomorrow we will review, and during stream as well

(For reference: glhf - good luck have fun, usually in rts games people are telling this to opponents)

Daily

https://leetcode.com/problems/length-of-longest-v-shaped-diagonal-segment/description/?envType=daily-question&envId=2025-08-27

Don't be that scared, 50% acceptance rate. Solved in 20 mins. Remember: rotation ONLY clockwise, and ONLY once.

After today's night nightmare with vectors, this is a joke task, really


Hint: Don't try bottom up, just do memoization, cause the number of parameters will be long in your dp function

#daily