Solution in Go, faster than 100%
\n\n# Code\n\nfunc findIntersectionValues(nums1 []int, nums2 []int) []int {\n    \n    m1 := map[int]bool{}\n    m2 := map[int]bool{}\n    \n    for _,v := rang
\n\n# Code\n```\nfunc findIntersectionValues(nums1 []int, nums2 []int) []int {\n    \n    m1 := map[int]bool{}\n    m2 := map[int]bool{}\n    \n    for _,v := range(nums1){\n        m1[v] = true\n    }\n    for _,v := range(nums2){\n        m2[v] = true\n    }\n    c1 := 0\n    for _,v := range(nums1){\n        if m2[v]{\n            c1++\n        }\n    }\n    c2 := 0\n    for _,v := range(nums2){\n        if m1[v]{\n            c2++\n        }\n    }\n    return []int{c1,c2}\n}\n```
['Go']