Kth Largest Element Approaches | Dataford Interview Questions

Find the Kth largest element in an array. How many approaches can you think of? Code any two of them.

Asked in the technical interview stage. The interviewer wanted Quickselect; the candidate coded sorting and a min-heap. Reported follow-ups included discussing the complexity of each approach.

Input and Output

Implement kth_largest(nums, k). nums is a non-empty list of integers, and k is a valid 1-based rank. Return the kth largest value. Treat duplicate values as separate elements.

Constraints

1 <= nums.length <= 100000
-10^9 <= nums[i] <= 10^9
1 <= k <= nums.length
Duplicate values count as separate elements
The function may modify nums

Function Signature

def kth_largest(nums, k):

Your question is Kth Largest Element Approaches. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem