3131. Find the Integer Added to Array I LeetCode Solution

In this guide, you will get 3131. Find the Integer Added to Array I LeetCode Solution with the best time and space complexity. The solution to Find the Integer Added to Array I problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

  1. Problem Statement
  2. Complexity Analysis
  3. Find the Integer Added to Array I solution in C++
  4. Find the Integer Added to Array I solution in Java
  5. Find the Integer Added to Array I solution in Python
  6. Additional Resources
3131. Find the Integer Added to Array I LeetCode Solution image

Problem Statement of Find the Integer Added to Array I

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.

Example 1:

Input: nums1 = [2,6,4], nums2 = [9,7,5]
Output: 3
Explanation:
The integer added to each element of nums1 is 3.

Example 2:

Input: nums1 = [10], nums2 = [5]
Output: -5
Explanation:
The integer added to each element of nums1 is -5.

Example 3:

Input: nums1 = [1,1,1,1], nums2 = [1,1,1,1]
Output: 0
Explanation:
The integer added to each element of nums1 is 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.

See also  2194. Cells in a Range on an Excel Sheet LeetCode Solution

Complexity Analysis

  • Time Complexity: O(n)
  • Space Complexity: O(1)

3131. Find the Integer Added to Array I LeetCode Solution in C++

class Solution {
 public:
  int addedInteger(vector<int>& nums1, vector<int>& nums2) {
    return ranges::min(nums2) - ranges::min(nums1);
  }
};
/* code provided by PROGIEZ */

3131. Find the Integer Added to Array I LeetCode Solution in Java

class Solution {
  public int addedInteger(int[] nums1, int[] nums2) {
    return Arrays.stream(nums2).min().getAsInt() - Arrays.stream(nums1).min().getAsInt();
  }
}
// code provided by PROGIEZ

3131. Find the Integer Added to Array I LeetCode Solution in Python

class Solution:
  def addedInteger(self, nums1: list[int], nums2: list[int]) -> int:
    return min(nums2) - min(nums1)
 # code by PROGIEZ

Additional Resources

Happy Coding! Keep following PROGIEZ for more updates and solutions.

Similar: