Find Maximum Subarray Length with K Distinct | Dataford Interview Questions

Write a function to solve a specific problem, and be prepared to code during the interview for RTI International.

Implement longest_subarray_at_most_k_distinct(nums, k), which returns the length of the longest contiguous subarray containing at most k distinct integers. Use a zero-based integer array and assume 1 <= k <= len(nums).

Constraints

1 <= nums.length <= 1000
1 <= k <= nums.length
-10^9 <= nums[i] <= 10^9
The subarray must be contiguous

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):

Your question is Find Maximum Subarray Length with K Distinct. 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 function to solve a specific problem, and be prepared to code during the interview for RTI International.

Constraints

1 <= nums.length <= 1000
1 <= k <= nums.length
-10^9 <= nums[i] <= 10^9
The subarray must be contiguous

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):

Your question is Find Maximum Subarray Length with K Distinct. 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.