Tap here to switch tabs
Problem
Submissions

Problem: Intersection of Three Sorted Arrays

Intersection of Three Sorted Arrays gives you three strictly increasing integer arrays and asks for every value shared by all three, returned in sorted order.

Statement

Given three integer arrays arr1, arr2, and arr3 sorted in strictly increasing order, return a sorted list of all integers that appear in all three given arrays.

Constraints:

  • 1≤1 \leq arr1.length, arr2.length, arr3.length ≤1000\leq 1000

  • 1≤1 \leq arr1[i], arr2[i], arr3[i] ≤2000\leq 2000

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Intersection of Three Sorted Arrays

Intersection of Three Sorted Arrays gives you three strictly increasing integer arrays and asks for every value shared by all three, returned in sorted order.

Statement

Given three integer arrays arr1, arr2, and arr3 sorted in strictly increasing order, return a sorted list of all integers that appear in all three given arrays.

Constraints:

  • 1≤1 \leq arr1.length, arr2.length, arr3.length ≤1000\leq 1000

  • 1≤1 \leq arr1[i], arr2[i], arr3[i] ≤2000\leq 2000