For those wondering about best case for Approach 3 - O(n * (n+m)) , what if n >>> m, then there is a standard technique to swap(n, m) thus getting always best case iteration of for loop. Do connect on twitter, we are posting some wild tweets these days ❤ - x.com/aryan_mittal007
@codingkart245Ай бұрын
last observation is brilliant mahn!!!!
@selfsigma9764Ай бұрын
I solved the problem by my own using 2nd approach. Although it was an easy problem But when I saw title of your video, I become sure that you surely have something insteresting..And you gave amazing insight about the problem.. Thanks
@bhavanasharma5713Ай бұрын
last part was awesome
@gowtham9153Ай бұрын
In approach 2, we can directly check whether row[i] == col[i] under single for loop right? Because it means it has same number in row as well as column. Or I am thinking something wrong. Please respond
@nptel1punith929Ай бұрын
The last one is🔥🔥🔥
@Ayush37262Ай бұрын
What if we don't have distinct values, will the solution fail??
@shandil663Ай бұрын
Aryan bhai I have question if I am able to solve a particular problem using brute force or better than brute force do I need to know all the approaches possible to solve that problem.
@NoName-hd7okАй бұрын
Yes ,optimised one will make a good impression in interview