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 ] : th-cam.com/play/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls.html ✅✅✅[ Graphs Data Structure ] : th-cam.com/play/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C.html ✅✅✅[ January Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn.html ✅✅✅[ December Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA.html ✅✅✅[ November Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e.html ✅✅✅[ August Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe.html ✅✅✅July Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC-.html ✅✅✅June Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG.html ✅✅✅May Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e.html ✅✅✅Cracking the Coding Interview - Unique String: th-cam.com/play/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE.html Struggling in a question?? Leave in a comment and we will make a video!!!🙂🙂🙂
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 ] : th-cam.com/play/PLJtzaiEpVo2zx-rCqLMmcFEpZw1UpGWls.html
✅✅✅[ Graphs Data Structure ] : th-cam.com/play/PLJtzaiEpVo2xg89cZzZCHqX03a1Vb6w7C.html
✅✅✅[ January Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2wCalBcRcNjXQ0C6ku3dRkn.html
✅✅✅[ December Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xo8OdPZxrpybGR8FmzZpCA.html
✅✅✅[ November Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2yMYz5RPH6pfB0wNnwWsK7e.html
✅✅✅[ August Leetcoding Challenge ] : th-cam.com/play/PLJtzaiEpVo2xu4h0gYQzvOMboclK_pZMe.html
✅✅✅July Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wrUwkvexbC-vbUqVIy7qC-.html
✅✅✅June Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2xIfpptnCvUtKrUcod2zAKG.html
✅✅✅May Leetcoding challenges: th-cam.com/play/PLJtzaiEpVo2wRmUCq96zsUwOVD6p66K9e.html
✅✅✅Cracking the Coding Interview - Unique String: th-cam.com/play/PLJtzaiEpVo2xXf4LZb3y_BopOnLC1L4mE.html
Struggling in a question??
Leave in a comment and we will make a video!!!🙂🙂🙂
One of the excellent algorithm series so far. Well explained each example with diagrams. Good job.
Thanks!!
I got this in an interview and I bombed. I wish I had seen this video earlier ..Beautifully explained..
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?
SUCH A BEAUTIFUL EXPLANATION, THANK YOU!
Thanks !!
Your explanations are amazing! Thank you for making these videos.
Glad you like them!
I needed that first hint then I got the algorithm. Thank you
Great !! Keep going !!
Best explanation of the search space reduction solution! Thanks for sharing.
on point presentation
Most underrated channel
Thanks :)
thank you maam
love the diagram
Really like this approach and explaination
Just amazing explanation, now words.... and the best thing is visualisation,
At first i applied binary search on each row which has n logm complexity. Now found very optimal method.
Very good
Great explanation. Thanks!
Glad it was helpful!
I think time complexity would be O(n*m) in worst case
Super! Way to go!!
Thank you so much 😀
Awesome as always!
Thank you! Cheers!
Really good stuff ,
Such a perfect explanation
Thanks !
Amazing
Great work.
Thankyou !!
Thanks for the explanation
You're welcome
well explained !
Most welcome!!
Really really good!
Thanks !!
bext explanation....keep it up and thanks a lot
Thanks Nikita!! 😊
Excellent explanation...Please continue making these kind of videos.
Thank you!! 🙂🙂
Is there any Part 1 video?
why is c = matrix[0].length ? why we have written 0 ??
Awesome
Thanks :)
leetcode 74 is same as this question!
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
Wow
Thanks :)
Why dont I come with such awsome tricks : (
You didn't tell why we can't start from (0, 0) and (n - 1, m - 1)????