All prompts are owned by LeetCode. To view the prompt, click the title link above.
First completed : May 29, 2024
Last updated : July 01, 2024
Related Topics : Array, Hash Table, Sorting, Counting
Acceptance Rate : 68.035 %
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))