Minimum Window for Suspicious Tokens | Dataford Interview Questions

Problem

Given a list of log tokens tokens and a list of required indicators required, return the shortest contiguous subarray of tokens that contains every token in required with at least the same frequency. If no such subarray exists, return an empty list. Inputs are lists of strings, and the output is a list of strings.

Constraints

1 <= len(tokens) <= 10^5
1 <= len(required) <= 10^4
tokens[i] and required[i] are non-empty strings
Token comparison is case-sensitive

Problem

Constraints

1 <= len(tokens) <= 10^5
1 <= len(required) <= 10^4
tokens[i] and required[i] are non-empty strings
Token comparison is case-sensitive

Problem

Constraints

1 <= len(tokens) <= 10^5
1 <= len(required) <= 10^4
tokens[i] and required[i] are non-empty strings
Token comparison is case-sensitive

Problem

Constraints

1 <= len(tokens) <= 10^5
1 <= len(required) <= 10^4
tokens[i] and required[i] are non-empty strings
Token comparison is case-sensitive