WATCH IN 1.5X SPEED 🗣🗣🗣🗣

Golden Standards for teaching! Great work man!

Beautiful! :)

subscribe++;

What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP

What I don’t understand if you could please explain is why h-1 is used on every subtree, so for example, x root, go right have a z node, left of z node is another Y node, left of the Y node we have just a triangle (working on double rotation) which has a height of h-1, right of the Y node we have another triangle which has the height of h-2, right of Z node we have a triangle which is again h-1. Left of root x we have one triangle that is h-1, now where do these h-2 and h-1 come from. Also when checking the imbalance, a h+1 comes in to make it an imbalance of 2. How does this work, I can’t wrap my head around it. PLEASE HELP

I hate algorithms. nice video tho

Thank you very much sir!!

Wow, just wow! On a side note, I think it's better to consider the position of the LSB in the 0-indexed way, since in that case an index is directly responsible for 2^(0-indexed position of LSB) element below it, inclusive of itself. Then cascading to the appropriate next element is intuitive, just remove the LSB. Essentially going down 2^(0-indexed position of LSB) :D. Anyways, fantastic job!

x1.5

top top explanation

Beautiful!

5:10 Really confuses me because how does the algo know if the capacity is filled or not? Sure if I take dp[i-1][j], I take the one cell above and I know it fulills the capacity as well but at which point can the algorithm casually decide to include 2 items, repsectively x items in the KnapSack? Like, in dp[2][4], we're talking about item 2 but for some reason we can fit in both in there because the weight limit is 4. Somewhere the algo kind of figured out that the weight limit was reduced to 1 because item 1 was inserted but because item 2 has weight 1, we can insert item 2 as well?

blud just saved me

Very descriptive. Thank you!

Sir plz tell vertices and nodes are same

Thank you so much for your excellent explanation.

you are amazing, thank you so much

can someone help me how to write a complete code for this? using c language

How to create that visual representation?

i need this code for MATLAB please

Thanks!

this is way better than a 2-hour lecture from a CS professor with multiple PhD's explanation. Thank God I found your video.

Thanks!

this is an awesome explanation. Thank you very much.

In summary: - Ford-Fulkerson: Tackles the Maximum Flow problem using DFS (O(Ef) Complexity) - Edmonds-Karp: Tackles the Maximum Flow problem using BFS (O(VE^2) Complexity)

wonderful explanation, kudos to your efforts!

so amazing super nice quality

I understand nothing☻

Wow this is by far the most understandable explanation of this concept that I've seen. Thank you!

Thank you.

the diagonal arrow was confusing.

Still great in 2024

Can you explain to me the mean of memo matrix?

extremely helpful video. thank you sir.

Thanks mate

A fellow student from hyperskill, psted your video link. On the lee algorithm course conent. It is helpful.

poor explanation ! make an example and solve it instead of bla bla

❤❤ such a lovely video, understood the concept clearly.

Why the fuck are you marking ids as visited. That makes no fucking sense.

Blanced Binary Search trees are cool

Love from S Korea

wonderful

Two hours before an exam; you're a lifesaver!

Best😭❤❤❤❤

Not meaning to brag, but: I've stumbled upon an interesting recreational problem, entailing running 700+ dijkstra's algorithms on a graph of over 1mil nodes (whose adjacency matrix occupies 145GB of disk space). This video was of tremendous value to me, and thank you!

brilliant video thanks

we need an order, right ? it goes like we start from the smallest number to the biggest or backward, am i right ?

Thank you for this series!

Thank you for these series!