BUT,

Daily leetcode will be performed no matter what!!! Maybe we even do small stream, we will see

Morning LC

Daily

backtracking sudoku (hard)

https://leetcode.com/problems/sudoku-solver/description/?envType=daily-question&envId=2025-08-31

#daily

Now better, much better

As the guy, who already had 5 surgeries, and knows what is it random health shit - stating rn: “I fuck your bullshit shit”. First day, I somehow stepped in the stone in the sea, and injured toe, cause it was slippery and I unsuccessfully stepped somehow and got injury. Now I cannot walk properly.

Not stating, that flight got cancelled 15h before, so we had to do flight with stops , and pay extra for this.

Like man, wtf is this. Now in worst case I will go to ambulance locally, average case will be almost not walking, and best case 1-2 days and it will recover enogh. Like doc and gpt tells me it is not that serious, can wait 4-5 days until I go back, but fuck, what a luck.

Literally me cursing all this “lucky” shit, but mostly health. Idk it is ridiculously randomized in a bad way somehow during the life. Is it only me?

Daily


Not hard, try it

https://leetcode.com/problems/maximum-average-pass-ratio/description/?envType=daily-question&envId=2025-09-01

#daily

Hint: observe the following if you have 1/2 => 0.5, and 3/5 => 0.6
Try adding extra student to each of them and check what will improve things more:

1/2 => 2/3 => 0.66; 0.66-050 = 0.16

3/5 => 4/6 => 0.66; 0.66-0.60 = 0.01

so 0.16>0.01. Now you need to do it for all the numbers.

Solution:
Use the max heap, whereas the key is the gain that will happen if we add the extra student. Use this key in heap (python does not have max heap, so we will work with just negative number to emulate it).

Now for all extra student every single time you get the class where you can get the biggest gain, and add this gain -> then push it back to the heap.

In the end we just calculate the average

Tommy, where is my money??

Hint: the data constraints are 0 >= n >= 50, it means you definitely can allow yourself n^2 or n^3. Don't overthink much, don't think about optimization.

Solution: yeah, in official one it is the same just bruteforce it: try every possible point, (right bottom) find all the points that match the criteria (left up), for this pair: check whether there is any other point inside. If no point is inside - increment counter.

Due to injury, cannot swim in the sea, but yesterday I realized I can in the swimming pool, cause they have convenient stairs. Now it is game changer, so daily leetcode is a bit late today.

Soon we gonna check where game of thrones was filmed, will post pictures

Manager: When the feature will be ready?

Me: