Minimum Alert Window Coverage | Dataford Interview Questions

Problem

Given a list of alert codes alerts and a list of required alert codes required, return the shortest contiguous subarray of alerts that contains every code from required with at least the same frequency. If no such subarray exists, return an empty list. The function should return the subarray values, not the indices.

Constraints

1 <= len(alerts) <= 10^5
1 <= len(required) <= 10^5
alerts[i] and required[i] are non-empty strings
The sum of lengths of all strings is at most 2 * 10^5

Problem

Constraints

1 <= len(alerts) <= 10^5
1 <= len(required) <= 10^5
alerts[i] and required[i] are non-empty strings
The sum of lengths of all strings is at most 2 * 10^5

Problem

Constraints

1 <= len(alerts) <= 10^5
1 <= len(required) <= 10^5
alerts[i] and required[i] are non-empty strings
The sum of lengths of all strings is at most 2 * 10^5

Problem

Constraints

1 <= len(alerts) <= 10^5
1 <= len(required) <= 10^5
alerts[i] and required[i] are non-empty strings
The sum of lengths of all strings is at most 2 * 10^5