Easy solution in Python💯✅
IntuitionFirst remove duplicates using set() and then iterate through each list to find elements not present in the other. These unique elements are appended to
# Intuition
 First remove duplicates using set() and then iterate through each list to find elements not present in the other. These unique elements are appended to their respective result lists.

# Complexity
- Time complexity:O(N^2) as we are using two for loops to check
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

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

# Code
```python3 []
class Solution:
    def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]:
        answer=[[],[]]
        x=list(set(nums1))
        y=list(set(nums2))
        for i in range(len(x)):
            if x[i] not in y:
                answer[0].append(x[i])
        for i in range(len(y)):
            if y[i] not in x:
                answer[1].append(y[i])
        return answer

        
```
![dfc8570d-35b1-4f1c-9c58-8835758be62c_1690230597.7965565.png](https://assets.leetcode.com/users/images/de350e74-5e53-4375-aae6-b842bddd6d20_1737725912.5466192.png)

['Python3']