Розмір відео: 1280 X 720853 X 480640 X 360
Показувати елементи керування програвачем
Автоматичне відтворення
Автоповтор
k
Yes that is why i have compared it with 0 only.
Hello Sir, we can do the same problem in O(N), using Quickselect Algorithm, Thanks for the great explanation.
No brother it totally depend on the type of test case. Worst case for qucik select can be N^2. Thanks
@@code_kar_lo Ya, that's true, worst case time complexity goes N^2.
Thanks for Guiding me through your video , I always watch your video even i solve question myself .As, Always there is a new thing to learn from your video
Thanks a lot 🙏❤️
I have one doubt why we are traversing array index from i=1 instead of i=0 in the last loop, since array indexing always start from 0..please clear..
Yes but in the given array we do not have any zeros as par the constraints that is why we are traversing from 1.
nycc .. just a suggestion try to explain gfg/ leetcode contest solutions . ur views will also go up . THANKYOU
Thanks. I have time issues otherwise i can upload leetcode as well
k
Yes that is why i have compared it with 0 only.
Hello Sir, we can do the same problem in O(N), using Quickselect Algorithm, Thanks for the great explanation.
No brother it totally depend on the type of test case. Worst case for qucik select can be N^2. Thanks
@@code_kar_lo Ya, that's true, worst case time complexity goes N^2.
Thanks for Guiding me through your video , I always watch your video even i solve question myself .
As, Always there is a new thing to learn from your video
Thanks a lot 🙏❤️
I have one doubt why we are traversing array index from i=1 instead of i=0 in the last loop, since array indexing always start from 0..please clear..
Yes but in the given array we do not have any zeros as par the constraints that is why we are traversing from 1.
nycc .. just a suggestion try to explain gfg/ leetcode contest solutions . ur views will also go up . THANKYOU
Thanks. I have time issues otherwise i can upload leetcode as well