CodingHardcod-p018

Subject HeapLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[[3,2,1,5,6,4],2]out5

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.