Easy JS solution includes()
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```javascript []\n/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number[]}\n */\nvar findIntersectionValues = function(nums1, nums2) {\n    let result1 = 0 \n    let result2 = 0 \n\n    for(let i = 0 ;i<nums1.length;i++){\n        if(nums2.includes(nums1[i])){\n            result1++\n        }\n    }\n\n    for(let i = 0;i<nums2.length;i++){\n        if(nums1.includes(nums2[i])){\n            result2++\n        }\n    }\n    return [result1,result2]\n};\n```
['JavaScript']