Leetcode 2934. Minimum Operations to Maximize Last Elements in Arrays

Choose index-wise swaps (swap nums1[i] with nums2[i]) so that after all operations nums1[n-1] and nums2[n-1] become the maximum values of their respective arrays, minimizing the number of swaps or returning -1 if impossible. The core challenge is selecting feasible target maxima for each array and deciding swap/no-swap at each index to achieve them with the fewest swaps.