K-th largest element
Given a list of integers and an integer k (1 <= k <= length of the list), return the k-th largest element counted with duplicates — that is, the element in position k when the list is arranged from largest to smallest. Repeated values occupy one position each, so in [3, 8, 8, 1] the 2nd largest is 8, not 3. Write a function that returns this value.
Implement
kth_largest(nums: list[int], k: int) → intExamples
in
[[3,8,8,1],2]out8What 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 12 min
solution.py
InputExpectedGot
[[3,8,8,1],2]8not run yetsample