Swift soltuion
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(n)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    func findIntersectionValues(_ nums1: [Int], _ nums2: [Int]) -> [Int] {\n        let set1 = Set(nums1)\n        let set2 = Set(nums2)\n        var count1 = 0\n        for int in nums1 where set2.contains(int) {\n            count1 += 1\n        }\n        var count2 = 0\n        for int in nums2 where set1.contains(int) {\n            count2 += 1\n        }\n        return [count1, count2]\n    }\n}\n\n```
['Array', 'Swift', 'Ordered Set']