Easy and Super Fast solution C#
\n# Complexity\n- Time complexity: O(N log 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# Complexity\n- Time complexity: O(N log 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```csharp []\npublic class Solution {\n    public int MinimumAddedInteger(int[] nums1, int[] nums2) {\n        Array.Sort(nums1);\n        Array.Sort(nums2);\n        int x = int.MaxValue;\n        for(int i = 0; i <= 2; i++)\n        {\n            int target = nums2[0] - nums1[i];\n            if(Cheking(nums1, nums2, target))\n            {\n                x = Math.Min(x, target);\n            }\n        }\n        return x;\n    }\n\n    public bool Cheking (int[] arr1, int[] arr2, int x)\n    {\n        int count = 0;\n        for(int i = 0, j = 0; i < arr1.Length && j < arr2.Length; i++)\n        {\n            if(arr1[i] + x != arr2[j])\n            {\n                count++;\n            }\n            else\n            {\n                j++;\n            }\n        }\n        if(count > 2)\n        {\n            return false;\n        }\n        return true;\n    }\n}\n```\n![89f26eaf70fa927a79d4793441425859.jpg](https://assets.leetcode.com/users/images/fc4d9913-d348-49e2-abc5-2c07147a0f61_1730270873.1815863.jpeg)\n
['Array', 'Sorting', 'C#']