Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Longest Subarray with at Most K Distinct Values
00:00
5 left

Longest Subarray with at Most K Distinct Values

MediumPython

Problem

How do you approach Hackerrank-style coding problems?

Implement the described solution for a representative array problem. Given an integer array nums and integer k, return the length of the longest contiguous subarray containing at most k distinct values.

Function signature: longest_subarray_at_most_k_distinct(nums, k)

Return an integer. The input array is non-empty, and values may repeat.

Constraints

  • 1 <= nums.length <= 1000
  • 0 <= k <= nums.length
  • 1 <= nums[i] <= 10^9

Function Signature

def longest_subarray_at_most_k_distinct(nums, k):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.