Optimized Array Intersection | Dataford Interview Questions

Explain how you would find the intersection of two arrays and return an object that includes arr1, arr2, and both.

Implement array_intersection(arr1, arr2). Return a dictionary containing the original arrays under arr1 and arr2, plus both, which contains each distinct value present in both arrays once, ordered by its first appearance in arr1.

Constraints

0 <= len(arr1), len(arr2) <= 10000
Each array contains integers
The result contains each shared value at most once
The order of both follows first appearance in arr1
The input arrays must be returned unchanged in the output object

Function Signature

def array_intersection(arr1, arr2):

Your question is Optimized Array Intersection. 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

Explain how you would find the intersection of two arrays and return an object that includes arr1, arr2, and both.

Constraints

0 <= len(arr1), len(arr2) <= 10000
Each array contains integers
The result contains each shared value at most once
The order of both follows first appearance in arr1
The input arrays must be returned unchanged in the output object

Function Signature

def array_intersection(arr1, arr2):

Your question is Optimized Array Intersection. 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.