clean solution
Intuition\n Describe your first thoughts on how to solve this problem. \nSince we are dealing with distinct integers, a set is applicable. Creating a set as wel
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSince we are dealing with distinct integers, a set is applicable. Creating a set as well as a list to add the distict elements to is ideal after which we can simply combine it with the second case and return the 2-dimensional list. \n\n\n# Code\n```\nclass Solution:\n    def findDifference(self, nums1: List[int], nums2: List[int]) -> List[List[int]]:\n        s1 = set(nums1)\n        s2 = set(nums2)\n        arr1 = []\n        arr2 = []\n        for i in range(len(nums1)):\n            if nums1[i] not in s2:\n                arr1.append(nums1[i])\n                s2.add(nums1[i])\n        for i in range(len(nums2)):\n            if nums2[i] not in s1:\n                arr2.append(nums2[i])\n                s1.add(nums2[i])\n        return [arr1, arr2]\n```
['Python3']