simplest solution ever
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```java []\nclass Solution {\n    public int minimumAddedInteger(int[] nums1, int[] nums2) \n    {\n        Arrays.sort(nums1) ;\n        Arrays.sort(nums2) ;\n\n        int mini = Integer.MAX_VALUE , ans = Integer.MAX_VALUE ;\n\n        for(int i = 0 ; i<Math.min(3 , nums1.length) ; i++ )\n        {\n            mini = nums2[0] -  nums1[i] ;\n\n            if(check(nums1, nums2, mini))  ans = Math.min(ans, mini) ;\n\n        }\n\n        return ans ;\n        \n    }\n\n    static boolean check(int[] nums1 , int[] nums2 , int diff )\n    {\n        int count = 0 , j = 0  ;\n\n        for(int i = 0 ; i<nums1.length && j <nums2.length;  i++)\n        {\n            if(nums1[i] + diff  != nums2[j])  count++ ;\n            else\n            j++ ;\n        }\n\n        return (count <=2) ;\n    }\n}\n```
['Java']