Search a 2D Matrix II | Live Coding with Explanation | Leetcode - 240

preview_player
Показать описание
This is one of the most liked question from the leetcode community and also from the interview perspective.

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
Рекомендации по теме
Комментарии
Автор

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

I got this in an interview and I bombed. I wish I had seen this video earlier ..Beautifully explained..

praveennvs
Автор

One of the excellent algorithm series so far. Well explained each example with diagrams. Good job.

tusharvengurlekar
Автор

I needed that first hint then I got the algorithm. Thank you

santanu
Автор

SUCH A BEAUTIFUL EXPLANATION, THANK YOU!

ajaib
Автор

instead of moving 1 cell at a time can we do some kind of binary search to discard multiple row/collums at once and further optimize this?

JSDev
Автор

Best explanation of the search space reduction solution! Thanks for sharing.

autoot
Автор

Really like this approach and explaination

VikashSingh-ufqr
Автор

Your explanations are amazing! Thank you for making these videos.

crisag.
Автор

Just amazing explanation, now words.... and the best thing is visualisation,

ankurjain
Автор

why is c = matrix[0].length ? why we have written 0 ??

abheermehrotra
Автор

Excellent explanation...Please continue making these kind of videos.

realAB
Автор

At first i applied binary search on each row which has n logm complexity. Now found very optimal method.

anvesh
Автор

bext explanation....keep it up and thanks a lot

Nikita-hvjm
Автор

I think time complexity would be O(n*m) in worst case

karanmandveb-
Автор

Why dont I come with such awsome tricks : (

amitupadhyay
Автор

You didn't tell why we can't start from (0, 0) and (n - 1, m - 1)????

himanshupal