Problem · Hash Table
Maximum Frequency Stack
● Hard
AmazonFULLTIMEPHONE SCREEN
See Amazon hiring insightsAmazonFULLTIMEPHONE SCREENProblem statement
Design a stack-like data structure that supports push and pop.
The problem statement continues
ProExamples
Example 1
operations = ["push","push","push","push","push","push","pop","pop","pop","pop"]values = [5,7,5,7,4,5,0,0,0,0]return = [5,7,5,4]The first pop returns 5 because it has frequency 3. The next two pops break frequency ties by recency, and the final pop returns 4.
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
- 1 more worked example, 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