Sliding Window and Aho-Corasick | Dataford Interview Questions

Write a class to add and count events received in the last X seconds, and then determine if all words from a sentence are present in a paragraph.

Use nondecreasing timestamps and treat the window as inclusive: [timestamp - X, timestamp]. The grading function accepts event operations plus a sentence and paragraph, returning count results and a Boolean word-coverage result. Words are case-insensitive alphanumeric tokens, and repeated sentence words only need to appear once.

Constraints

0 <= operations.length <= 5000
Operations are ordered by nondecreasing timestamp
Each timestamp is an integer or floating-point number
0 <= window_seconds
Words are matched case-insensitively as alphanumeric tokens
Repeated words in the sentence are treated as one required word

Function Signature

def analyze_events_and_words(operations, window_seconds, sentence, paragraph):

Your question is Sliding Window and Aho-Corasick. 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

Write a class to add and count events received in the last X seconds, and then determine if all words from a sentence are present in a paragraph.

Constraints

0 <= operations.length <= 5000
Operations are ordered by nondecreasing timestamp
Each timestamp is an integer or floating-point number
0 <= window_seconds
Words are matched case-insensitively as alphanumeric tokens
Repeated words in the sentence are treated as one required word

Function Signature

def analyze_events_and_words(operations, window_seconds, sentence, paragraph):

Your question is Sliding Window and Aho-Corasick. 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.