2 Lines of Code LOL, Beats 90% too :)
Intuition\n Describe your first thoughts on how to solve this problem. \nLet\'s simply use set operations to do this. Convert both nums1 and nums2 into their re
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nLet\'s simply use set operations to do this. Convert both nums1 and nums2 into their respective sets, and return their set difference, in the form of a list. As simple that!\n# Approach\n<!-- Describe your approach to solving the problem. -->\n- Convert into the two sets: ```set1, set2```\n- Take the set difference of both ```list(set1 - set2)``` and ```list(set2 - set1)``` and cast it as a list (since that is what we need to return)\n- Return!\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n# Code\n```\nclass Solution:\n    def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]:\n        set1, set2 = set(nums1), set(nums2)\n        return [list(set1 - set2), list(set2 - set1)]\n```
['Python3']