Kth largest element
Return the k-th LARGEST element in an unsorted integer array (1-indexed, so k=1 is the maximum). Implement average O(n) selection (e.g. quickselect), not a full sort. The k-th largest is the value at sorted position; duplicates count by value position. Constraints: 1 <= k <= len(nums) <= 10^5, -10^9 <= nums[i] <= 10^9.
Implement
kth_largest(nums: list[int], k: int) → intExamples
in
[[3,2,1,5,6,4],2]out5What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 28 min
solution.py
InputExpectedGot
[[3,2,1,5,6,4],2]5not run yetsample