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
Merge Sorted Lists to Length
00:00
5 left

Merge Sorted Lists to Length

EasyPython

Problem

HubSpot may need to combine two already sorted HubSpot CRM activity streams and display only the earliest k activities. Given two ascending arrays, return the first k values from their sorted merge without sorting the full combined array.

Formal Specification

Implement merge_until_k(list1, list2, k).

  • list1 and list2 are arrays of integers sorted in nondecreasing order.
  • k is a nonnegative integer.
  • Return an array containing at most k values from the merged sorted sequence.
  • If fewer than k values exist, return every available value.
  • Preserve duplicates. The input arrays must not be modified.

Constraints

  • 0 <= len(list1), len(list2) <= 10^5
  • 0 <= k <= 10^5
  • -10^9 <= list1[i], list2[j] <= 10^9
  • The total input size is at most 2 * 10^5
  • Both input arrays are sorted in nondecreasing order

Function Signature

def merge_until_k(list1, list2, k):
Interviewer

Your question is Merge Sorted Lists to Length. 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.