[Solved] Minimum Sum of Squared Difference LeetCode Contest
![[Solved] Minimum Sum of Squared Difference LeetCode Contest](https://realcoder.techss24.com/wp-content/uploads/2022/07/Solved-Minimum-Sum-of-Squared-Difference-LeetCode-Contest.png "[Solved] Minimum Sum of Squared Difference LeetCode Contest")
Minimum Sum of Squared Difference: You are given two positive 0-indexed integer arrays nums1 and nums2, both of length n. The sum of squared difference of arrays nums1 and nums2 is defined as the sum of (nums1[i] – nums2[i])2 for each 0 <= i < n. You are also given two positive integers k1 and k2. You can modify any…