Skip to content

Overview Resume Score

Practice

LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading problem

Kth Strongest Signal · medium heap interview problem · Larpy

medium· heap Mock interview

Kth Strongest Signal

Given an array `signals` and an integer `k`, return the k-th largest value (1-indexed, counting duplicates).

Examples

in: signals = [3,2,1,5,6,4], k = 2

out: 5

sorted desc: 6,5,...

in: signals = [3,3,3], k = 2

out: 3

duplicates count

Constraints

1 <= k <= len(signals) <= 10^5
-10^9 <= signals[i] <= 10^9

Hints

target: O(n log k) time⌘↩ run · ⇧⌘↩ submit

More heap problems

Last Stone Weighteasy
Median From Data Streamhard
K Closest Points to Originmedium
Kth Largest Element in an Arraymedium
Task Schedulermedium