JAVA SOLUTION || 100% FASTER || 100% MEMORY EFFICIENT
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```\nclass Solution {\n    public int[] findIntersectionValues(int[] num1, int[] num2) {\n        List<Integer> l1 = new ArrayList<>();        \n        List<Integer> l2 = new ArrayList<>();\n        \n        for(int i : num1) {\n            l1.add(i);\n        }\n        for(int i : num2) {\n            l2.add(i);\n        }\n        int ans[] = new int[2];\n        int c = 0;\n        for(int i = 0; i < num1.length; i++) {\n            if(l2.contains(num1[i])) c++;\n        }\n        \n        ans[0] = c;\n        \n        c = 0;\n        \n        for(int i = 0; i < num2.length; i++) {\n            if(l1.contains(num2[i])) c++;\n        }\n        \n        ans[1] = c;\n        \n        return ans;\n    }\n}\n```
['Java']