Interview Questions
Interview Guides
Experiences
Explore
Get started
Sign in
Interview Guides
All questions
/
Coding
Top-K in Continuous Event Streams
Hard
Asked at 1 company
Hash Tables
Arrays
Heap
Problem
Write an algorithm to find the top K most frequent user events in a massive, continuous data stream.
Question
Answer
Problem
Write an algorithm to find the top K most frequent user events in a massive, continuous data stream.
Your answer
Edit
Preview
Try one AI text evaluation on us
Get structured feedback, scored against a 4-axis rubric. Premium unlocks unlimited.
0 words
target ~200
Try a free preview
Stuck? Get a hint
Past attempts
Up next
Top-K Frequent Items in Stream
Hard
Top K Queries in a Stream
Medium
N
Top K Frequent Elements in Streams
Hard
Next question
Top-K in Continuous Event Streams | Dataford Interview Questions
