Skip to content

Practice Find the Integer Added to Array I

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

Easy#3131
LeetCode Problem

Find the Integer Added to Array I

Problem Statement

You are given two arrays of equal length, nums1 and nums2. Each element in nums1 has 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 integer x.

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

Examples

# Example 1

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

# Example 2

Input
nums1 = [10], nums2 = [5]
Output
-5

# Example 3

Input
nums1 = [1,1,1,1], nums2 = [1,1,1,1]
Output
0

Constraints

1 <= nums1.length == nums2.length <= 100
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 adding x to each element of nums1.

Related LeetCode Problems

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

Review your practice with PhantomCodeAI

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