Medium Data Structures Problem | Dataford Interview Questions

The Sequoia portfolio dashboard receives a chronological array of activity types for a company or portfolio segment. Find the length of the longest contiguous window containing at most k distinct activity types.

A window must contain consecutive elements from the input array. Return 0 when the array is empty.

Formal Specification

Implement longest_activity_window(activity_types, k).

Input: activity_types, a list of strings, and k, a positive integer.
Output: an integer representing the maximum length of a contiguous subarray with at most k distinct strings.

Constraints

0 <= len(activity_types) <= 10^5
1 <= k <= 10^5
Each activity type is a non-empty string of at most 30 characters
The answer must use consecutive elements

Function Signature

def longest_activity_window(activity_types, k):

Your question is Medium Data Structures Problem. 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