Finding Duplicate Orders in Logs | Dataford Interview Questions

Given an array of daily transaction logs, write a function to identify duplicate orders placed within a one-minute window.

Each log is a dictionary with an order_id string and a nonnegative timestamp integer in seconds. Return the unique order IDs from the earlier log in each qualifying pair, ordered by timestamp. A pair qualifies when the later timestamp is at most 60 seconds after the earlier timestamp. Logs may be unsorted.

Constraints

0 <= logs.length <= 9999
Each log contains exactly one string order_id and one nonnegative integer timestamp
0 <= timestamp <= 10^9
Return each qualifying order ID at most once
The one-minute boundary is inclusive

Function Signature

def detect_duplicate_orders(logs):

Your question is Finding Duplicate Orders in Logs. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array of daily transaction logs, write a function to identify duplicate orders placed within a one-minute window.

Constraints

0 <= logs.length <= 9999
Each log contains exactly one string order_id and one nonnegative integer timestamp
0 <= timestamp <= 10^9
Return each qualifying order ID at most once
The one-minute boundary is inclusive

Function Signature

def detect_duplicate_orders(logs):

Your question is Finding Duplicate Orders in Logs. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.