Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 135

Kth Largest Element in a Stream

EasyHeap

Design a class seeded with k and nums. add(val) appends val and returns the kth largest so far. Tests call kthLargest(ops, args).

Examples

Example 1

Input: ops = ["KthLargest","add","add","add","add","add"], args = [[3,[4,5,8,2]],[3],[5],[10],[9],[4]]

Output: [null,4,5,5,8,8]

Constraints

0 ≤ nums.length ≤ 10⁴At least k total values exist after every add operation

Target ComplexityNot required

O(n log n) Time · O(n) Space

Companies (3)

AmazonGoogleFacebook

Node 22.08.0

Loading editor…

Test casesRun to compare output

Input

ops = ["KthLargest","add","add","add","add","add"], args = [[3,[4,5,8,2]],[3],[5],[10],[9],[4]]

Output

—

Expected

[null,4,5,5,8,8]