Learner friendly Java Solution
\n\n# Code\njava []\nclass Solution {\n    public List<List<Integer>> findDifference(int[] nums1, int[] nums2) {\n        Set<Integer> s1 = new HashSet<>();\n  
\n\n# Code\n``` java []\nclass Solution {\n    public List<List<Integer>> findDifference(int[] nums1, int[] nums2) {\n        Set<Integer> s1 = new HashSet<>();\n        for(int i: nums1)    s1.add(i);\n        Set<Integer> s2 = new HashSet<>();\n        for(int i: nums2)    s2.add(i);\n        Set<Integer> common = new HashSet<>();\n        for(int i: s1){\n            if(s2.contains(i))  common.add(i);\n        }\n        s1.removeAll(common);\n        s2.removeAll(common);\n        return Arrays.asList(new ArrayList<>(s1), new ArrayList<>(s2));\n    }\n}\n```
['Java']