## [Solution] Intersection of Multiple Arrays Solution Leetcode

**Intersection of Multiple Arrays Solution Leetcode** Given a 2D integer array `nums`

where `nums[i]`

is a non-empty array of **distinct** positive integers, return *the list of integers that are present in each array of*

`nums`

*sorted in*.

**ascending order**

**Example 1:**

## [Solution] Intersection of Multiple Arrays Solution Leetcode

Input:nums = [[,1,2,3,5],[1,2,4,3],[4,3,5,6]]4Output:[3,4]Explanation:The only integers present in each of nums[0] = [,1,2,3,5], nums[1] = [1,2,4,3], and nums[2] = [4,3,5,6] are 3 and 4, so we return [3,4].4

**Example 2: [Solution] Intersection of Multiple Arrays Solution Leetcode**

Input:nums = [[1,2,3],[4,5,6]]Output:[]Explanation:There does not exist any integer present both in nums[0] and nums[1], so we return an empty list [].

**Constraints: [Solution] Intersection of Multiple Arrays Solution Leetcode**

`1 <= nums.length <= 1000`

`1 <= sum(nums[i].length) <= 1000`

`1 <= nums[i][j] <= 1000`

- All the values of
`nums[i]`

are**unique**.