find-the-integer-added-to-array-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two integer arrays <code>nums1</code> and <code>nums2</code>.

We say that <code>nums2</code> is reachable from <code>nums1</code> with an integer <code>x</code> if there exist two elements in <code>nums1</code> that, when removed, and <code>x</code> is added to all the remaining elements of <code>nums1</code> (or subtracted in the case of a negative <code>x</code>), the resulting array becomes equal to <code>nums2</code>. Two arrays are considered equal when they contain the same integers with the same frequencies.

Return the minimum possible integer <code>x</code> that makes <code>nums2</code> reachable from <code>nums1</code>.

It is guaranteed that <code>nums2</code> is reachable from <code>nums1</code> with at least one <code>x</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: nums1 = [4,20,16,12,8], nums2 = [14,18,10]

Output: -2

Explanation:

After removing elements at indices <code>[0,4]</code> and adding -2, <code>nums1</code> becomes <code>[18,14,10]</code>.
</div>

Example 2:

<div class="example-block">
Input: nums1 = [3,5,5,3], nums2 = [7,7]

Output: 2

Explanation:

After removing elements at indices <code>[0,3]</code> and adding 2, <code>nums1</code> becomes <code>[7,7]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>3 &lt;= nums1.length &lt;= 200</code></li>
	<li><code>nums2.length == nums1.length - 2</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 1000</code></li>
	<li>
	It is guaranteed that <code>nums2</code> is reachable from <code>nums1</code> with at least one <code>x</code>.
	</li>
</ul>