Sliding Window Coding | Dataford Interview Questions

Palantir Foundry pipelines may process an ordered stream of event types from an operational workflow. Given the event types in arrival order, find the length of the longest contiguous subsequence containing no repeated event type.

Implement longest_unique_event_window(events).

Formal Specification

Input: events, a list of strings representing event types in chronological order.
Output: An integer representing the maximum length of a contiguous subsequence in which every event type appears at most once.
Event order must be preserved, and the selected subsequence must be contiguous.

Constraints

0 <= len(events) <= 10^5
Each event type is a non-empty string of at most 100 characters
Event types are compared using exact, case-sensitive equality
Return 0 when events is empty

Function Signature

def longest_unique_event_window(events):

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