✅ Easy C++ Solution
Code\n\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {\n        int count1 = 0;\n        int count2
# Code\n```\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {\n        int count1 = 0;\n        int count2 = 0;\n        vector<int> ans;\n\n        int n1 = nums1.size();\n        int n2 = nums2.size();\n\n        for(int i=0;i<n1;i++)\n        {\n            for(int j=0;j<n2;j++)\n            {\n                if(nums1[i] == nums2[j])\n                {\n                    count1++;\n                    break;\n                }\n            }\n        }\n        for(int i=0;i<n2;i++)\n        {\n            for(int j=0;j<n1;j++)\n            {\n                if(nums2[i] == nums1[j])\n                {\n                    count2++;\n                    break;\n                }\n            }\n        }\n        ans.push_back(count1);\n        ans.push_back(count2);\n\n        return ans;\n    }\n};\n```
['C++']