Kth largest unsorted
Return the kth largest element in an unsorted array (the kth in sorted order, not the kth distinct).
Implement
find_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 35 min
solution.py
InputExpectedGot
[[3,2,1,5,6,4],2]5not run yetsample