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
Intersection of Sorted Lists
00:00
5 left

Intersection of Sorted Lists

EasyPython

Problem

Criteo services may compare sorted identifier lists when processing audience or Retail Media matching results. Given two sorted lists of integers, return their intersection as a sorted list containing each common value only once.

Formal Specification

Implement intersection_sorted_lists(nums1, nums2). The inputs are two non-decreasing lists of integers. Return a new list of integers containing every distinct value that appears in both inputs, in ascending order. Do not modify either input list.

Duplicate occurrences in either input must appear only once in the result. If the lists have no common value, return an empty list.

Constraints

  • 0 <= len(nums1), len(nums2) <= 10^5
  • -10^9 <= nums1[i], nums2[i] <= 10^9
  • Both inputs are sorted in non-decreasing order.
  • The inputs must not be modified.

Function Signature

def intersection_sorted_lists(nums1, nums2):
Interviewer

Your question is Intersection of Sorted Lists. 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.