Simple brute force solution
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*N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(N)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minimumAddedInteger(vector<int>& nums1, vector<int>& nums2) {\n        int n=nums2.size();\n         int mini=INT_MAX;\n        if(n==1){\n            for(int i=0;i<=2;i++){\n                  mini=min(nums2[0]-nums1[i],mini);\n            }\n            return mini;\n        }\n       \n          sort(nums1.begin(),nums1.end());\n          sort(nums2.begin(),nums2.end());\n       \n        vector<int>diff;\n        for(int i=1;i<nums2.size();i++){\n            diff.push_back(nums2[i]-nums2[0]);\n        }\n        for(int i=0;i<=nums1.size()-2;i++){\n            vector<int>v=diff;\n            int c=0;\n            for(int j=i+1;j<nums1.size();j++){\n                int d=nums1[j]-nums1[i];\n                if(v[c]==d){\n                    c++;\n                }\n                if(c==v.size()){\n                    mini=min(nums2[0]-nums1[i],mini);\n                    break;\n                }\n                \n            }\n           \n        }\n        return mini;\n    }\n};\n```
['Array', 'C++']