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

[@AlgorithmsMadeEasy]

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:
✅✅✅[ Tree Data Structure ] : ruclips.net/p/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls
✅✅✅[ Graphs Data Structure ] : ruclips.net/p/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C
✅✅✅[ January Leetcoding Challenge ] : ruclips.net/p/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn
✅✅✅[ December Leetcoding Challenge ] : ruclips.net/p/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA
✅✅✅[ November Leetcoding Challenge ] : ruclips.net/p/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e
✅✅✅[ August Leetcoding Challenge ] : ruclips.net/p/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe
✅✅✅July Leetcoding challenges: ruclips.net/p/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC-
✅✅✅June Leetcoding challenges: ruclips.net/p/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG
✅✅✅May Leetcoding challenges: ruclips.net/p/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e
✅✅✅Cracking the Coding Interview - Unique String: ruclips.net/p/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂

[@praveennvs]

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

[@tusharvengurlekar3914]

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

[@AlgorithmsMadeEasy]

Thanks!!

[@abhineveash]

Thank you

[@santanu29]

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

[@AlgorithmsMadeEasy]

Great !! Keep going !!

[@kshitijvarma2566]

thank you maam

[@JSDev776]

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?

[@AvinashKumar-ps4tw]

Really good stuff ,

[@VikashSingh-uf1qr]

Really like this approach and explaination

[@pranavsharma7361]

on point presentation

[@ajaib1313]

SUCH A BEAUTIFUL EXPLANATION, THANK YOU!

[@AlgorithmsMadeEasy]

Thanks !!

[@JasbirSingh-kp4eu]

Most underrated channel

[@AlgorithmsMadeEasy]

Thanks :)

[@crisag.2698]

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

[@AlgorithmsMadeEasy]

Glad you like them!

[@auto8ot644]

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

[@samarthshiramshetty2711]

Is there any Part 1 video?

[@gago3001]

love the diagram

[@ankurjain8467]

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

[@i.vigneshdavid1698]

Thanks for the explanation

[@AlgorithmsMadeEasy]

You're welcome

[@sridharg1421]

Great explanation. Thanks!

[@AlgorithmsMadeEasy]

Glad it was helpful!

[@wtfitcntbdiff]

Very good

[@amanshutaklikar7435]

well explained !

[@AlgorithmsMadeEasy]

Most welcome!!

[@henriquefernandesfeitosa1155]

Such a perfect explanation

[@AlgorithmsMadeEasy]

Thanks !

[@rahulprasad8125]

Super! Way to go!!

[@AlgorithmsMadeEasy]

Thank you so much 😀

[@ashwinvarma9349]

Awesome as always!

[@AlgorithmsMadeEasy]

Thank you! Cheers!

[@djlivestreem4039]

Amazing

[@zn4798]

Really really good!

[@AlgorithmsMadeEasy]

Thanks !!

[@AmazingWorld-fw9oc]

Great work.

[@AlgorithmsMadeEasy]

Thankyou !!

[@realAB459]

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

[@AlgorithmsMadeEasy]

Thank you!! 🙂🙂

[@anvesh5377]

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

[@Nikita-hv5jm]

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

[@AlgorithmsMadeEasy]

Thanks Nikita!! 😊

[@karanmandveb-5818]

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

[@zn4798]

leetcode 74 is same as this question!

[@praveennvs]

no...there, the first element of the row is larger than the lasst element of the previous row..You do not have the constraint here

[@abheermehrotra329]

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

[@daanishsarguru3044]

Awesome

[@AlgorithmsMadeEasy]

Thanks :)

[@dudadoodedoodedoode]

Wow

[@AlgorithmsMadeEasy]

Thanks :)

[@amitupadhyay6511]

Why dont I come with such awsome tricks : (

[@himanshupal2672]

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