Kth Smallest | GFG POTD | C++ | Java | Code Kar Lo

[@aizad786iqbal]

k

[@code_kar_lo]

Yes that is why i have compared it with 0 only.

[@gautamjangir8927]

Hello Sir, we can do the same problem in O(N), using Quickselect Algorithm, Thanks for the great explanation.

[@code_kar_lo]

No brother it totally depend on the type of test case. Worst case for qucik select can be N^2. Thanks

[@gautamjangir8927]

@@code_kar_lo Ya, that's true, worst case time complexity goes N^2.

[@AyushKumar-id9np]

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

[@code_kar_lo]

Thanks a lot 🙏❤️

[@utkarshbajpayee3568]

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..

[@code_kar_lo]

Yes but in the given array we do not have any zeros as par the constraints that is why we are traversing from 1.

[@amardeep7714]

nycc .. just a suggestion try to explain gfg/ leetcode contest solutions . ur views will also go up . THANKYOU

[@code_kar_lo]

Thanks. I have time issues otherwise i can upload leetcode as well