Answer: HAPPILO Hiring Challenge | Online Assessment Interview Question | Off-Campus (20

Approach Store unique elements of both arrays using HashSet. Traverse each set and collect elements missing in the other. Return both result lists. Java Solution import java.util.*; class Solution { public List<List<Integer>> findDifference(int[] nums1, int[] nums2) { Set<Integer> set1 = new HashSet<>(); Set<Integer> set2 = new HashSet<>(); for (int num : nums1) { set1.add(num); } for (int num : nums2) { set2.add(num); } List<Integer> diff1 = new ArrayList<>(); List<Integer> diff2 = new ArrayList<>(); for (int num : set1) { if ...