JAVA || EASY TO UNDERSTAND || BASIC ITERATION || 100%
\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        int add = 0;\n        int add1 = 0;\n        // comparing 1st a
```\nclass Solution {\n    public int[] findIntersectionValues(int[] nums1, int[] nums2) {\n        int add = 0;\n        int add1 = 0;\n        // comparing 1st array to 2nd array //\n        for(int i=0;i<nums1.length;i++)\n        {\n            for(int j=0;j<nums2.length;j++)\n            {\n                if(nums1[i] == nums2[j])\n                {\n                    add++;\n                    break;\n                }\n            }\n        }\n        // comparing 2nd array to 1st array //\n          for(int i=0;i<nums2.length;i++)\n        {\n            for(int j=0;j<nums1.length;j++)\n            {\n                if(nums2[i] == nums1[j])\n                {\n                    add1++;\n                    break;\n                }\n            }\n        }\n        return new int[]{add,add1};\n    }\n}\n\n```
['Java']