c# 2 line solution, faster than 92%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public IList<IList<int>> FindDifference(int[] nums1, int[] nums2) {\n        HashSet<int> h1 = new HashSet<int>(nums1), h2 = new HashSet<int>(nums2);\n\n        return new List<IList<int>> { \n            h1.Where(x => !h2.Contains(x)).ToList<int>(), \n            h2.Where(x => !h1.Contains(x)).ToList<int>() \n        };\n    }\n}\n```
['C#']