Sliding Window Logger Design | Dataford Interview Questions

Design the logic for a logger (solved with a sliding window), with a follow-up needing a different algorithm.

Asked in the onsite DSA 3 stage.

Implement should_print_message(timestamp, message, last_seen). Return True if the message has not been printed during the previous 10 seconds, otherwise return False. When returning True, update last_seen with the message's timestamp. Timestamps arrive in nondecreasing order. Discuss a follow-up where timestamps may arrive out of order and explain why the original approach is insufficient.

Constraints

Timestamps are nonnegative integers.
Timestamps passed to the main function are in nondecreasing order.
Messages are nonempty strings.
The cooldown interval is exactly 10 seconds.
The state dictionary contains only previously accepted messages.

Function Signature

def should_print_message(timestamp, message, last_seen):

Your question is Sliding Window Logger Design. 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

Design the logic for a logger (solved with a sliding window), with a follow-up needing a different algorithm.

Asked in the onsite DSA 3 stage.

Constraints

Timestamps are nonnegative integers.
Timestamps passed to the main function are in nondecreasing order.
Messages are nonempty strings.
The cooldown interval is exactly 10 seconds.
The state dictionary contains only previously accepted messages.

Function Signature

def should_print_message(timestamp, message, last_seen):

Your question is Sliding Window Logger Design. 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.