Array Intersection Basics

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Array Intersection Basics. Start with the requirements on the right.

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.

Problem

The Meta IT mobile support app receives two arrays of feature identifiers from different client configurations. Return the distinct identifiers that appear in both arrays.

The result must preserve the order in which values first appear in nums1. Each value should appear at most once in the result, even if it occurs multiple times in either input array.

Formal Specification

Implement intersection(nums1, nums2):

nums1 and nums2 are arrays of integers.
Return an array containing every distinct integer present in both arrays.
Preserve the first-occurrence order from nums1.
Return an empty array when no values are shared.
Do not modify either input array.

Constraints

0 <= nums1.length, nums2.length <= 10^5
-10^9 <= nums1[i], nums2[i] <= 10^9
Inputs may contain duplicates
The result contains distinct values and preserves nums1 order

Function Signature

def intersection(nums1, nums2):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output