Видео

Hey man! Nice video ...❤ @ 4:57 But why are we using if () in 22nd line ? Just While with the same condition isn't enough ?

So even if a and b reduces maxFreq doesn't change @ERIC ?

Thank you so much! even after 3 years you're still helping us

The simplicity and clarity of the solution is insane! I was stuck on how to do the in-order traversal but forgot that the last level traversed was already linked but could move to the next one by simply head.next and just add != null to the while loop

Nicely explained, it's a bit long though, but clear one

great explanation I found even after 3 years. Thank you!!

So basically this is a version of finding the largest number in the array using binary search.

I don't know why but I have difficultly in dry run of top down approach This dry run 😔😭

Ps3=ps1+ps2 How?

Quick comment I love this video and it was very helpful but rightMax has to be height.length -1. What is rightMax is 0 but the height[0] is more than the height[i] on the second for loop. This would cause an error. Only 2 years late lol

Thanks for the code!!

Great ❤

Thanks for the video ❤ I understood the approach But the thing is how could i come up with this idea on my own? Thats main issue here! Recently Practicing dp !! But , i will learn but , couldn't solve on my own

Great!

But why should we take 2d array of profit.length, capacity+1 Why not profit length and capacity

I watched multiples, I finally got it from you explanation, thanks you .

Great solution ❤

What a wonderful question and solution ❤

So good ❤

Oh goddd how many sums i should do to make dp easy for me😂😅🙏🙏🙏

Thanks

I have issues with dp especially at creating array for memorization

Thanks 😊❤ I got backtracking now

Thanks Eric 🇮🇳🙏

Thanks a lot Exmuslim movement zindabad

How evil people make money... MS is like one of the worst corporations on the planet... Can't spend money in hell..

the best explaination ❤

need to be in-place, so queue is not optimal

I used to either see solution for backtracking or simply skip Due to my incapability of coping with tedious work of dryrun Now I'm good Thanks to Eric❤ and striver❤

Love the way , he frames his own test cases and cross check the code

Just use sort(colours) And thank me later

I have started seriously doing leet code from August Ill be back and comment back i get a job Unlike @nguyenquoctran8423

Thanks

Thank you i learnt sorting 2d arrays while seeing this solution

Ill do it on my own after 6months lets see if can remember the logic

Man I want to do these problems on my own😢 You are great btw ❤

Thanks man

Thanks ❤ this needs practice and repetition

I didn't get how second for loop solves the issue that first for loop couldn't solve

Thanks it helped ❤

Thanks ❤

Good explanation mate

Eric Underrated and so much deserving tutor ❤

Great explanation！whats tool to draw on the board? Can I add into my interview?

🎉❤

❤❤❤

Thanks eric❤

Why can't we use Queue<Integer>q=new ArrayList<>(); I do got an error using this line , as soon as I change it to Linkedlist its accepted?

Thanks a lot ❤

Premium question ill pass