How should I practice Streaming Top K Frequent Elements?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon phone screen problems in FastPrep.

Is Streaming Top K Frequent Elements associated with Amazon?

FastPrep tags this as a Amazon phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Hash Table

Streaming Top K Frequent Elements

● Hard

AmazonFULLTIMEPHONE SCREEN

See Amazon hiring insights

Problem statement

Given an integer array stream and an integer k, process the values from left to right. After each new value arrives, return the current most frequent distinct values.

The problem statement continues

Pro

Examples

Example 1

stream = [1,2,1,3,2,1]k = 2return = [[1],[1,2],[1,2],[1,2],[1,2],[1,2]]

Value 1 becomes the unique leader after its second arrival. When values 1 and 2 both have frequency 2, the smaller value comes first.

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
1 more worked example, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week