Leetcode 2333. Minimum Sum of Squared Difference

Given two arrays and up to k1 and k2 unit +/-1 edits, minimize the sum of (nums1[i]-nums2[i])^2 by optimally allocating k = k1+k2 operations to reduce absolute element-wise differences; the core challenge is distributing potentially many (k up to 1e9, n up to 1e5) unit changes to minimize the quadratic cost, typically via greedy reduction of largest differences or thresholding.