quite a tricky question, but brilliant explanation
@techdose4u24 күн бұрын
Thanks :)
@HARSHRAJ-gp6veАй бұрын
Excellent approach sir
@techdose4uАй бұрын
Thanks :)
@Ishan-z8mАй бұрын
nice explanation bhaiya.
@techdose4uАй бұрын
dhanyawaad :)
@sailendrachettri8521Ай бұрын
nice approach :)
@techdose4uАй бұрын
Glad it was helpful!
@monsuruokuniyi1234Ай бұрын
The first case, where you include only subarray starting from the left and remove every other element on the right, was not included in the code. Is there any reason why? Because according to your approach, we should check for each condition. It seems to me that the code checked the 2nd and 3rd conditions but not the first.
@techdose4uАй бұрын
It checked all the conditions. 1st instance it checked for case-1 (before starting the while loop shortest is assigned )
@devmahadАй бұрын
thanks :)
@techdose4uАй бұрын
welcome back :)
@challengemania4447Ай бұрын
Sir can you please tell us the secret behind generating large test case yourself🙏
@techdose4uАй бұрын
It takes me a lot of time to make slides. Secret recipe: Patiece (and a lot of it) 🙂
@vaibhav454Ай бұрын
Please discuss Binary Search Approach
@techdose4uАй бұрын
next time if its optimal :)
@21flame72Ай бұрын
in constraints 10^5 N^2 Algorithm will not works can you explain with some examples for these types of Time Complexity Make a video if you are free sir
@Ishan-z8mАй бұрын
yes sir how you know that n2 is not working
@techdose4uАй бұрын
I have already made a video on how to filter the algorithm after looking at problem constraint. I will post the video in community post
@shivammishra6220Ай бұрын
@@Ishan-z8m in 1sec, max 10^9 operation we can be execute, (10^5)^2=10^10>>10^9. I hope this will clear your doubts.