Top K Frequent Elements
Amazon● MediumNEW GRADOAProblem statement
Given a nonempty integer array nums and an integer k, return the k distinct values that occur most frequently.
The problem statement continues
ProExamples
Example 1
nums = [1,1,1,2,2,3]k = 2return = [1,2]Value 1 appears three times and value 2 appears twice.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week