Longest Subarray with At Most k Repeats | Dataford Interview Questions

Given an integer array and k, find the longest contiguous subarray where no element appears more than k times.

Asked in the Round 1 stage.

Implement longest_subarray(nums, k) and return the maximum length. The array may contain positive, zero, or negative integers.

def longest_subarray(nums, k):

Your question is Longest Subarray with At Most k Repeats. 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.

Given an integer array and k, find the longest contiguous subarray where no element appears more than k times.

Asked in the Round 1 stage.

Implement longest_subarray(nums, k) and return the maximum length. The array may contain positive, zero, or negative integers.

def longest_subarray(nums, k):

Your question is Longest Subarray with At Most k Repeats. 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.