Simple and effective explanation and solution. Thanks!

In line 12, what is the intuition behind "max(dist) * 100" ?

Keep going🔥🔥

I really enjoyed this format. Easier to understand the thought process behind the solution.

Nice solution!

Awesome explanation !!

好聪明

hey! Thank you for the video. But what's the intuition behind this? Is that just because you made up a large table and see the behavior that when index is 0 we fill nothing inside, when index is 1 you fill one 1 in and index is 2 you fill two 1s in and then you conclude that we have to fill n-1 1 into that given x? I really appreciate your response! Thank you

Tricky problem, took me a while to figure out.

Tricky problem, took me a while to figure out.

What's up with that thumbnail 💀

So explanation is awesome!!! Thanks, Subscribed!

After checking many videos, I found this one to be the best for this problem. Thanks for the detailed explanation

Why'd you stop? I used to watch your explanations daily even if I solved the questions myself. I found your solutions and their way of explaining to be very helpful. Please continue if you can... Thanks!

The only reason why I'm here is not knowing what minimum absolute difference is

Thanks a lot! Great explanation. A general question: for someone struggling with questions involving operations with many indicies, do you there is a specific foundation that needs to be learned or it is matter of practicing and increasing one's working memory capacity? I am asking, because questions like this make me feel like trying to juggle many things simultaneously and getting confused with all the "moving parts"

Perfectly explained video, holy, thank you very much.

this explanation is so good

Nice explanation, thanks

Thanks for the logic!

when we flip the mask, do that mean we remove that character from the mask? how does it work? if we remove from it, then we break the substring to two substrings

Awesome explanation... Especially, The part where, "Just after explaining the equations, you also take an example to illustrate it, instead of just messing around with variables." Thanks...

thanks for discussing all the possible solutions. it helps to see the problems from different sides.

goated

Thank youu

The solution is straightforward, but I could never have come up with it myself.😢

nice explanation

Very good explanation. I was having a hard time understanding the prefix sum thing, thank you. I love that you use Excalidraw, it makes it very beautiful and readable. One note: mod still works fine for negative numbers. k mod p = k + n*p mod p, so adding or subtracting p is essentially the same as adding 0.

Explained this code very well

loved the explanation 👍

awesome video :)

thanks dude

Way better solution than neetcode!

the solution is amazing , you are doing a great job . I am following you for a while.🙌

dude voice too low.

Thank you, this is very clever implementation. PS Using the Integer[] cache will result in an impressive 6ms execution time.

Great explanation man 👌, Loved it!

This is the best and most cleaned and well-explained, Thank you so much for the excellent content. Subscribed

it was really impressive solution

The dedication is impressive. Keep up the good work.

Great explanation

doing a great job man , helping a. noobie like me .

Subscribed. This is brutal! I can barely understand and follow the algorithm, even with chatgpt, the solution and a video explanation I'm still having difficulties understanding how to apply this approach to another problem like counting all occurrences of lowercase characters (a-z) in a given string. Masking is extremely powerful and is a must-have tool, so thank you for the video!

Man, you rock! Thanks for all you're doing!

nice solution!

Thank you, you are a legend.

Can you explain contest questions aswell?

I just realised, you use Ai to generate your thumbnails right?

I had an interesting problem where I accidentally derived this algorithm. The question was to place each number of an input array into one of 2 arrays as you go, depending on which of the 2 arrays had more elements strictly greater than the current number at the time. I tracked a sorted version of each array, comparing the bisect.bisect_right index relative to the size of the array to get the strictly greater than count and then using bisect.insort to insert into the appropriate sorted array. The funny thing is I did that recently and didn't see the application it had to this problem haha

Love your videos, please make videos daily