Simple python3 solution | 47 ms - faster than 91.37% solutions
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n``` python3 []\nclass Solution:\n    def minimumAddedInteger(self, nums1: List[int], nums2: List[int]) -> int:\n        nums1.sort()\n        nums2.sort()\n\n        options = sorted(set(\n            nums2[0] - nums1[i]\n            for i in range(3)\n        ))\n\n        def check(delta):\n            shift = 0\n            for i, elem in enumerate(nums2):\n                while nums1[i + shift] + delta < elem:\n                    shift += 1\n                    if shift == 3:\n                        return False\n                if nums1[i + shift] + delta > elem:\n                    return False\n            return True\n\n        for i in range(len(options) - 1):\n            if check(options[i]):\n                return options[i]\n        return options[-1]\n```
['Two Pointers', 'Sorting', 'Enumeration', 'Python3']