Google logoGoogle
Coding·45 minMembers

Streaming Insert + Find K-th Largest

Members only

Onsite coding round 1 in NYC: design a class with `insert(num)` and `findLargest(k)` where `findLargest(k)` returns the `(k+1)`-th largest value with ties allowed. Time complexity of find should be as...

SWE
data-structure
tree
medium
Frequency
Single report
Last asked
2026-02-04
Stage
onsite-coding

Log in to continue reading the full content