✅Easy and simple Solution ✅Beginner Friendly ✅clean code
Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F\nFoll
***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***<br>\n**Follow me on LinkeDin [[click Here](https://www.linkedin.com/in/ayushluthra62/)]**\n\n# Complexity\n- Time complexity:\nO(N * N)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findIntersectionValues(vector<int>& nums1, vector<int>& nums2) {\n        vector<int>result;\n        int count1 = 0;\n        int count2 = 0;\n        \n        \n        for(auto i : nums1){\n        \n            if(find(nums2.begin(),nums2.end(),i)!=nums2.end()) count1++;\n        }\n\n        for(auto i : nums2){\n            \n            if(find(nums1.begin(),nums1.end(),i)!=nums1.end()) count2++;\n            \n        }\n\n        return {count1,count2};\n    }\n};\n```\n***Guy\'s if you find this solution helpful \uD83D\uDE0A, PLEASE do UPVOTE. By doing that it motivate\'s me to create more better post like this \u270D\uFE0F***<br>\n**Follow me on LinkeDin [[click Here](https://www.linkedin.com/in/ayushluthra62/)]**
['Array', 'C++']