You explained the optimized part in the best way from all the videos on youtube, thanks!

finally understood the last method 😭 it took my day while learning from striver

Please continue with more array questions. Your explanation is top notch.

that is the only video where I could understand intuition

Я скачал leetcode Torture (расширение для гугла), после чего там далась эта задача, которую я не мог решить в течении часа, (потому что я не когда не заходил на leetcode) но вы обьяснили эту задачу так быстро и проффесионально. Большое спасибо! I downloaded the Leetcode Torture extension, and then I got this stupid problem that I was struggling with, like, for an hour, but you've solved it in just 20 minutes, and that quickly and professionally... with explained every step of the process. Thank you very much

I really like how you've arranged the videos in your playlist. The upcoming videos are somewhat related to the concepts learned in the previous lessons. Thanks!

You are a great teacher. That was the best explanation I found so far. Keep teaching.

Amazing explanation, got the understanding of firstRow and firstCol when I got stuck with the leetcode example where there is only a single 0 in middle of the matrix. Thanks.

Wonderful explanation! Finally got it, sir

Only you were able to explain it clearly for me, thanks brother

finally after watching many lecture your video is recommended and it's very helpful and clear my concept

please upload all dsa question , your explaination is best sir

Very clear explanation!!. Thanks a lot.

Thanks Helpful!

if there is no row or column that has 0 in it and we updated 0 in it from another element then how can we use 1st row and column to make change in whole row and column

we are with u sir thanks for make it so much easy soln

kya baat hai sir maja aa gaya . loved this

thanks!

Another solution without using extra space Start row wise first. Select rows one by one and make all the elements of that row -1 except which are 0, if any element in that row is 0. Similariy you have to do the same thing for columns. Now, before returning traverse the matrix and make all the -1 elements 0. public class Solution { public int[][] solve(int[][] A) { int n = A.length, m = A[0].length; for(int i = 0; i < n; i++){ int flag = 0; for(int j = 0; j < m; j++){ if(A[i][j]==0)flag = 1; } if(flag == 1){ for(int j = 0; j < m; j++){ if(A[i][j] != 0) A[i][j] = -1; } } } for(int j = 0; j < m; j++){ int flag = 0; for(int i = 0; i < n; i++){ if(A[i][j]==0)flag = 1; } if(flag == 1){ for(int i = 0; i < n; i++){ if(A[i][j] != 0) A[i][j] = -1; } } } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ if(A[i][j] == -1)A[i][j] = 0; } } return A; } }

The only part I was confused is the for(int i = 1;i

Thank you sir... this is just an amazing approach

Sir, Why we are using Matrix[0].length & Matrix.length in some for loops? What is the difference between them

Thanks

amazing explanation sir!!

great explanation!!

Very good explanation, please used to upload frequently, or if you have any community discord or other please tell us

your explanation is too good keep rocking

Please do upload videos regarding graph algorithms your explanation style will make it easy to understand.

Great sir ❤

Thanks understood

sorry have a question, why is this a constant space solution where there are nested loops multiple times? thanks so much

Great !!!!!

this gives incorrect Answer for this result matrix : [[1],[0],[3]] expected : [[0],[0],[0]] output: [[0],[0],[3]] --> this is in leet code , code which I wrote is below , let me know where I made mistake boolean firstRow = false, firstCol = false; // Set markers in first row and first column for(int i=0; i

Teaching mast hai bhai aapki

after doing so many leetcode questions like these, sometimes I feel like programming is all these hacks and tricks to make things more efficient. Anybody feels the same way?

even in the second and third solution Time complexity is M*N , cant we reduce the time complexity to M+N ??

wow i really dont like matrix problems. the best solution uses 2 nested for loops and 2 more for loops

The solution is wrong. Also why did you convert all the remaining elements to zero in the last step? If you take the example from striver's video he particularly said about that element.

Thanks