Can you pls explain what is the error

#1

Link ques:https://practice.geeksforgeeks.org/problems/swapping-pairs-make-sum-equal4142/1

Ide:-https://ide.geeksforgeeks.org/4p3HU6w3UQ

#2

if(A[i]+B[j]==diff){
return 1;
}
this condition inside while loop is not correct
Example
if sum1 is 10 and sum2 is 20
now diff is 10
if an element in arr1 is 9 and an element in arr2 is 1 both sum is 10 but if we swap them
then sum1 will be 2 and sum2 will be 28
but you return 1 which is incorrect

#3

Correct approach

  1. Sort both arrays
  2. maintain two pointers i ( 0 to n) & j ( 0 to m) and variable prevsum = MIN
  3. check sum of arrays swapping i & j, return 1 if same
  4. if difference of above sum’s (say X ) is greater than its prevsum, increment j, update prevsum = X
  5. else increment i, set j=0 , update prevsum = MIN
#4

Reference Code

#5

i am not able to understand the lasst two if and else statement can you please explain it again

#6

image
s1-s2 is the current difference
diff is previous difference
if current diff is greater than previous difference we have to swap greater no hence increase j
as array are sorted

else we have to swap smaller no so we increase i and set j to 0 also set diff to INT_MIN
means re-initialize the variables

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.