Kth Largest Element in an Array: coding question

Problem

You get an array of integers nums and an integer k. Return the kth largest item in nums.

The kth largest item is the item at position k when you sort nums from the largest to the smallest. Equal values count as separate items.

Input:: nums = [6,6,3,8,8,1], k = 3
Output:: 6
Explanation:: From the largest to the smallest, the items are [8, 8, 6, 6, 3, 1]. The item at position 3 is 6.

Find a solution that does not sort all of nums.

SysRound wrote this statement. A reference solution checks every example.

Continue with questions that share topics or the same question type.

K Closest Points to Origin
Coding · Array · Divide and Conquer · Geometry
Top K Frequent Elements
Coding · Array · Bucket Sort · Counting
Majority Element
Coding · Array · Boyer–Moore Majority Vote Algorithm · Counting
High Five
Coding · Array · Hash Table · Heap (Priority Queue)

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 3 records

LeetCode company tags · 6 records

Problem

You get an array of integers nums and an integer k. Return the kth largest item in nums.

The kth largest item is the item at position k when you sort nums from the largest to the smallest. Equal values count as separate items.

Input:: nums = [6,6,3,8,8,1], k = 3
Output:: 6
Explanation:: From the largest to the smallest, the items are [8, 8, 6, 6, 3, 1]. The item at position 3 is 6.

Find a solution that does not sort all of nums.

SysRound wrote this statement. A reference solution checks every example.