Intersection of Sorted Lists | Dataford Interview Questions

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):

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.

Problem