Leetcode 3132. Find the Integer Added to Array II

Given two arrays where nums2 is formed by removing two elements from nums1 and adding the same integer x to every remaining element of nums1, find the minimum integer x (can be negative) that makes the multisets equal. The core challenge is matching elements under a global shift while choosing which two elements to remove.