Problem · Array
Deduplicate Logs: Keep Latest
Problem statement
You are given log entries. The ith entry is the pair (timestamps[i], messages[i]). Two entries are duplicates when their messages are equal.
For each distinct message, keep one entry whose timestamp is greatest among all entries with that message. If that greatest timestamp occurs more than once for the same message, those entries represent the same retained pair and still produce only one result.
The problem statement continues
ProExamples
Example 1
timestamps = [30,10,20,15,20]messages = ["cache miss","user login","cache miss","heartbeat","user login"]return = ["15|heartbeat","20|user login","30|cache miss"]The greatest timestamps for cache miss, user login, and heartbeat are 30, 20, and 15. Sorting those retained pairs by timestamp gives the result.
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