Easy understand | Sort and compare | O(n*logn)
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: $$O(n*logn)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n*logn)$$ because of sort, expect for sorting, it\'s $$O(3n) = O(n)$$\n\n- Space complexity: $$O(n*logn)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(n*logn)$$ because of sort, expect for sorting, it\'s $$O(1)$$\n\n# Code\n```\nfunc minimumAddedInteger(nums1 []int, nums2 []int) int {\n    slices.Sort(nums1)\n    slices.Sort(nums2)\n    \n    ans := math.MaxInt\n    for i := 0; i <= 2; i++ {\n        interval := nums2[0] - nums1[i]\n        skiped := i\n        \n        for j := 0; j < len(nums2) && skiped <= 2; j++ {\n            n1 := nums2[j] - interval\n            \n            if n1 != nums1[j + skiped] {\n                skiped++\n                j--\n            }\n        }\n        \n        if skiped <= 2 {\n            ans = interval\n        }\n    }\n    \n    return ans\n}\n```
['Sorting', 'Go']