can you please explain the question
Problem dividing array
Here you need to find minimum and maximum possible value for sum of abs(a[i]-b[i]) for i from 0 to n-1. Approach:
- for maximum, pair largest element with smallest, 2nd largest with second smallest and so on.
- for mimimum, pair smallest element with 2nd smallest or arr[i] with arr[i+1] for every i=0,2,4,6…
try implementing this