K-th largest has three textbook solutions, and what interviewers watch for is knowing Quickselect's average O(n) beats sorting's O(n log n), why its worst case is O(n²), and when a heap is genuinely the better call. Here is the answer.
Unlock the other 847 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew