Whiteboard or Platform Coding | Dataford Interview Questions

Solve a coding challenge on a whiteboard or coding platform for Beyondmath.

Implement longest_subarray_at_most_k_distinct(nums, k). Given an integer list and k, return the length of the longest contiguous subarray containing at most k distinct values.

The function returns an integer, and an empty result is valid when k is zero or the input is empty. Constraints: 0 <= len(nums) <= 10^4, 0 <= k <= 10^4, and each value is between -10^9 and 10^9.

Constraints

0 <= nums.length <= 10^4
0 <= k <= 10^4
-10^9 <= nums[i] <= 10^9

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):

Your question is Whiteboard or Platform 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

Solve a coding challenge on a whiteboard or coding platform for Beyondmath.

Implement longest_subarray_at_most_k_distinct(nums, k). Given an integer list and k, return the length of the longest contiguous subarray containing at most k distinct values.

Constraints

0 <= nums.length <= 10^4
0 <= k <= 10^4
-10^9 <= nums[i] <= 10^9

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):

Your question is Whiteboard or Platform 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.