Detect Duplicate Items Within a 60-Second Sliding Window

bloomberg

Problem: Detect Duplicate Content Within a 60-Second Window

You are given a stream of content records sorted by non-decreasing timestamp. Each record has the following fields:

id, content...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: