InterviewBit Problems   Kth Smallest Element in the Array : Unsolved

About the Kth Smallest Element in the Array : Unsolved category (1)
Following all instruction | Worst case complexity O(N^2) | average case complexity smaller than O(N^2) (1)
The notes are misleading - it can't be done in linear time, constant space and without modifying the array (3)
Code running successfully in other compilers but showing error in this compiler (2)
3 line python code is enough for this problem (4)
Looks simple but Time limit exceeded, any help? (1)
Short Binary Search Solution explained (1)
FINALLY! a self explained solution (binary search solution - no sort) (1)
What is the approach to this problem? I've tried a bunch of methods like stuff (6)
What is wrong in my approach? (2)
Why not multiset (1)
Test case is wrong for Kth Smallest testcase where B us 22 (2)
What should be the time complexity of the solution? (7)
If failing for larger test cases (1)
JS solution for the problem not working in editor (1)
Complexity of binary search solution is also nlogn (2)
In cpp - double free problem, i'm not even using "new" (1)
InterviewBit is amazing (1)
Why the solution is showing TLE its N*Log(maximum element in the array) (1)
Is it given that the elements contain no duplicates? (1)
Eroor in Output (1)
Are you sure - it's constant space ? I can imagine O(k) space (2)
I did this question using heapsort, then why is it giving memory limit exceeded? (3)
Ok, i can't sort the given array, can't create auxiliary array. What am I suppose (5)
60, 94, 63, 3, 86, 40, 93, 36, 56, 48, 17, 10, 23, 43, 77, 1, 1, 93, 79, 4, 10, 4 (2)