Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
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
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess 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
Build my plan
Find Kth Duplicate in Array
00:00
5 left

Find Kth Duplicate in Array

MediumPython

Problem

Hp IQ telemetry processors may need to identify repeated event values in the order they first become known to be duplicates. Given an integer array and an integer k, return the kth distinct value that appears at least twice, ordered by its first appearance in the array. Count each duplicated value once, even if it appears more than twice. Return -1 if fewer than k distinct values are duplicated.

Formal Specification

Implement a function that accepts nums, a non-empty list of integers, and k, a positive integer. Return an integer representing the kth distinct duplicated value, or -1 when no such value exists. The output order is based on each value's first index in nums, not on frequency or the index of its second occurrence.

Constraints

  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9
  • 1 <= k <= nums.length
  • A duplicated value is counted once, regardless of its frequency

Function Signature

def kth_duplicate(nums, k):
Interviewer

Your question is Find Kth Duplicate in Array. 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.

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