Skip to content

Practice Find the Integer Added to Array II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3132
LeetCode Problem

Find the Integer Added to Array II

Problem Statement

You are given two integer arrays nums1 and nums2. From nums1 two elements have been removed, and all other elements have been increased (or decreased in the case of negative) by an integer, represented by the variable x. As a result, nums1 becomes equal to nums2. Two arrays are considered equal when they contain the same integers with the same frequencies. Return the minimum possible integer x that achieves this equivalence.

Source: Find the Integer Added to Array II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums1 = [4,20,16,12,8], nums2 = [14,18,10]
Output
-2

# Example 2

Input
nums1 = [3,5,5,3], nums2 = [7,7]
Output
2

Constraints

3 <= nums1.length <= 200
nums2.length == nums1.length - 2
0 <= nums1[i], nums2[i] <= 1000
The test cases are generated in a way that there is an integer x such that nums1 can become equal to nums2 by removing two elements and adding x to each element of nums1.

Related LeetCode Problems

Practice more problems similar to Find the Integer Added to Array II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.