Best explanation that I found!! You're great at explaining things. Keep going. You deserve more views👏.

@shahabsalem7272

4 жыл бұрын

I’m glad you liked it, I really appreciate your support 🙌 Stay tuned !

Amazing explanation! Thank you for making this!

Nice and easy Explanation this video deserves more views.

Please keep posting videos like these. This is a great explanation..

Best ever. Great work during pandemic.

I saw many videos but in vain. You nailed it with your beautiful explanation

This is the only video which has the best explanation of them all. Props to you Salem. Thanks for the great explanation.

@shahabsalem7272

3 жыл бұрын

Appreciate it man! 🙌

Just like others have said, 100% the best explanation out there. Just subscribed. Thank you, a billion times!

@shahabsalem7272

3 жыл бұрын

I’m so glad you liked it, and I appreciate the kind words!

Please keep making these leetcode video solutions

you are really good at explaining very helpful thank you very much!

Best explanation I have ever found. Good jobs!

Man !! Don't stop making these, please!

@shahabsalem7272

4 жыл бұрын

Appreciate the love 🙌

Great explanation. Thank you for the breakdown

Great Explaination! Didn't know Binary Search could be this complex

best explanation among all youtube videos, I have seen each and every video regarding this question but none of them explain so well, thanks, buddy. this video deserve more views

@shahabsalem7272

3 жыл бұрын

I’m really glad it helped man and I appreciate all your support 🙌😊

BEST EXPLANATION, THANK YOU MAN

This was really great. Thank you

Great explanation!! Thank you!

Excellent explanation. Thank you.

keep going bro its very useful system design, and leetcode solutions

really like the way u explained, keep doing it , it helped alot.

O(log(min(m+n))) time complexity which is faster than the initial O(log(m) + log(n)) we were asked. Great! Although I'm interested what the solution with theoretical complexity O(log(m) + log(n)) would have looked like.

If you not explain this problem, i could never understand it. Thanks a lot

Your explanation is too good bro!

please continue making tutorials for programming problems, just solve problems on leetcode with some explanation. Would love to watch them with your explanation

Very clearly explained!

Nice explanation! great job!

Awesome Bro..even some google engineers couldn't explain this way..hats off!

@shahabsalem7272

3 жыл бұрын

Thank you sir 🙌

Great explanation!

I love these kinds of videos. Thankyou professor Salem. Next, can we go over Integer to Roman?

@shahabsalem7272

4 жыл бұрын

Thanks Eman, glad it helped 🙌 I’ll look into Integer to Roman and it’s possible I’ll make an explanation for it.

watching this for 3 rd time in a few months. I struggle to remember LC Hards and how i approached them like after a month or so. So my strategy is to make Anki Flash Cards and store the solution as the answer. Most of the problems i remember the approach once i just see the question or think about it but these LC hards mess with my brain. Anyway im glad i watched this again, felt like i understood much more than the last time.

@shahabsalem7272

3 жыл бұрын

That an awesome strategy, I've also used Anki for Leetcode problems in the past! LC Hards are tough don't worry you aren't alone. I think having a general idea on how to approach an LC Hard (what data structure/algorithm to use etc) will be enough and you can figure out the rest of the minor details when answering the question. Good luck and thanks for watching!

Nice video! I wanted to ask, in the coding implementation could we still make this work if high was initialised to arr.length - 1 rather than arr.length?

This is awesome stuff. Can you make more explanation videos please? It was very easy to follow

Awesome explanation. Hope you get more subscribers, brother. i totally appreciate how you could optimize on whiteboard space

@shahabsalem7272

3 жыл бұрын

Appreciate it! Glad you liked it!

this vedio is really very helpful for me

This helped me alot. Thx

the best explanation . thanks

Great Work Man!😎, you deserve more man🤷‍♂️... Just subscribed!

@shahabsalem7272

3 жыл бұрын

Thanks man, appreciate you!

Great explanation 😊👍

Great explanation! Just wondering how did you come up with this way of solving the problem. If this was in a coding interview It would've taken me 45 days than 45 mins. Also keep it up!

@shahabsalem7272

3 жыл бұрын

Thank you! You’re definitely right about that, this is a tough question to come up with an optimal solution for in 45 minutes. I would say if this was an interview and you hadn’t see this type of question before you probably don’t need to come up with the the most optimal solution to pass, although of course this will depend on your interviewer’s expectations. I think as long as you are able to clearly explain your thought process and the pros and cons of a certain approach, illustrating a solid understanding of DS & A and Complexity analysis, you will have a good chance of doing good. However, I think the ability to solve new problems really comes from practice; not trying for 5 minutes and looking at the solution, but really trying to solve it independently and then understanding the reasoning behind your approach. This will allow you to recognise patterns in similar problems and help you perform better when faced with new problems.

@soumyajitchatterjee5822

3 жыл бұрын

Thanks. I will follow your advice.

Good job! Thanks.

This question is amazing

Thanks buddy😁😊

Thank You ✌️

thank you so much

great job lad

amazing

Did a great job dude. But how is it logarithmic? You are just incrementing or decrementing 1 based on if the max of left half of A or B is greater than min of right half of A or B.

Hi Shehab, Why did you apply Binary Search on the smaller array? Can we choose any array for the same?

@Prashantkumar-pn6qq

4 жыл бұрын

BTW amazing explanation. You earned yourself a subscriber here ✌

I’m walking out if I get this question