Longest Subarray with At Most K Distinct Integers

Describe how you would solve a medium-level coding challenge end to end, from clarifying requirements to implementing and testing your solution.

For the hands-on portion, implement longest_subarray_at_most_k_distinct(nums, k), returning the length of the longest contiguous subarray containing at most k distinct integers. Inputs are an integer array and a nonnegative integer k; return an integer.

Constraints

0 <= nums.length <= 10^5
0 <= k <= 10^5
-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 Longest Subarray with At Most K Distinct Integers. 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

Describe how you would solve a medium-level coding challenge end to end, from clarifying requirements to implementing and testing your solution.

Constraints

0 <= nums.length <= 10^5
0 <= k <= 10^5
-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 Longest Subarray with At Most K Distinct Integers. 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.