Easy hash table
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def maximumSetSize(self, nums1: List[int], nums2: List[int]) -> int:
        n = len(nums1)
        c1 = set(nums1)
        c2 = set(nums2)
        common = set()
        for k in c1:
            if k in c2:
                common.add(k)
        l1 = max(n//2 - (len(nums1) - len(c1)), 0)
        l2 = max(n//2 - (len(nums2) - len(c2)), 0)
        total = len(c1) + len(c2) - len(common)
        miss = max(l1 + l2 - len(common), 0)
        print(l1,l2,total,miss)
        return total - miss

```
['Python3']