Skip to content

Latest commit

 

History

History
37 lines (24 loc) · 908 Bytes

_2248. Intersection of Multiple Arrays.md

File metadata and controls

37 lines (24 loc) · 908 Bytes

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top


First completed : May 29, 2024

Last updated : July 01, 2024


Related Topics : Array, Hash Table, Sorting, Counting

Acceptance Rate : 68.035 %


Solutions

Python

class Solution:
    def intersection(self, nums: List[List[int]]) -> List[int]:
        current = set(nums[0])
        for i in range(1, len(nums)) :
            current = current.intersection(set(nums[i]))

        return sorted(list(current))