Find the kth largest element in a number stream

Question

1.00/5 (1 vote)

See more:

Design a class to efficiently find the Kth largest element in a stream of numbers. The class should have the following two things:

The constructor of the class should accept an integer array containing initial numbers from the stream and an integer ‘K’.

The class should expose a function add(int num) which will store the given number and return the Kth largest number.

What I have tried:

i don't know how to solve this

Posted 12-Jan-22 2:34am

Trilochna Vaid

Updated 12-Jan-22 4:03am

Add a Solution

Comments

Richard Deeming 12-Jan-22 8:36am

Your homework is set to test what YOU have learned, not how good you are at convincing a bunch of strangers to do your work for you.

If you really don't know where to start, talk to your teacher. That's what they're paid for!

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Answer 1 · 2022-01-12T04:02:00

Create an array of K elements, prefill it with the smallest number it can hold.
When you get a value, see if it is in the array already. If so, ignore it.
Check if it's lower that the lowest element in the array. If so, ignore it.
If not, insert it in the array in sorted order: between a lower and a higher value, or in the highest slot if necessary.
At the end of the stream, the lowest value in the array is the Kth highest value.

_Asif_ · Answer 2 · 2022-01-12T04:03:00

You need to understand that Homeworks are given for a reason. And the primary reason is to prepare you for real-world job tasks.

Apart from that, you don't even care to google the question, otherwise, you have had found the solution like below in less than a minute.

K'th largest element in a stream - GeeksforGeeks[^]

You have to understand that there is no shortcut of Success.

Find the kth largest element in a number stream

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0