Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 349 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 349 # by problem number
lcpy gen -s intersection_of_two_arrays # by problem name
nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order.
Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]
Explanation: [4,9] is also accepted.
class Solution:
# Time: O(n + m)
# Space: O(n + m)
def intersection(self, nums1: list[int], nums2: list[int]) -> list[int]:
return sorted(set(nums1) & set(nums2))
| Time | Space |
|---|---|
| O(n + m) | O(n + m) |