Resubmit Round 2 Coding Question | Dataford Interview Questions

Re-solve the Round 2 coding question you could not pass: explain your approach and write pseudocode on paper.

Asked in the Technical interview stage.

For this exercise, implement longest_subarray_at_most_k_distinct(nums, k). Return the length of the longest contiguous subarray containing at most k distinct integers.

Input and Output

nums is a non-empty list of integers and k is a non-negative integer. Return an integer.

Constraints

1 <= len(nums) <= 5000
0 <= k <= len(nums)
-10^9 <= nums[i] <= 10^9

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):

Your question is Resubmit Round 2 Coding Question. 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