Problem · Hash Table
Stream Unique Logs in Timestamp Order
Problem statement
Process a finite sequence of log-stream operations from left to right. Each log is a pair containing an integer timestamp and a message.
The problem statement continues
ProExamples
Example 1
operations = ["add","add","get","add","get","get"]timestamps = [5,3,0,1,0,0]messages = ["alpha","beta","","alpha","",""]return = ["3|beta","5|alpha","EMPTY"]The first get returns 3|beta. The second alpha log is rejected because that message was already accepted, so the next result is 5|alpha. The final get finds no pending log.
FastPrep Pro
Reported in 1 Google 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
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week