Easy java solution || Begginer friendly
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    static List<Integer> f(int [] c ,int [] d){\n           List<Integer> r = new ArrayList<Integer>();\n        for(int i=0;i<c.length;i++){\n            boolean f=false;\n            for(int j=0;j<d.length;j++){\n             if(c[i]==d[j]){\n                 f=true;\n                 break;\n             }\n            }\n         if(!f&&!r.contains(c[i])){\n         r.add(c[i]);\n         }\n        }\n        return r;\n    }\n    public List<List<Integer>> findDifference(int[] nums1, int[] nums2) {\n      List<List<Integer>> a = new ArrayList<List<Integer>>();\n      \n          boolean f=true;\n          a.add(f(nums1,nums2));\n          a.add(f(nums2,nums1));\n          return a;\n       \n    }\n}\n```
['Java']