top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

How to find a pair of elements swapping which makes sum of two arrays same?

0 votes
429 views
How to find a pair of elements swapping which makes sum of two arrays same?
posted Jul 7, 2017 by Ajay Kumar

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+1 vote
Write a program to print the sum of the elements of the array with the given below condition?

Write a program to print the sum of the elements of the array with the given below condition. If the array has 6 and 7 in succeeding orders, ignore 6 and 7 and the numbers between them for the calculation of sum.
Eg1) Array Elements - 10,3,6,1,2,7,9
O/P: 22
[i.e 10+3+9]
Eg2) Array Elements - 7,1,2,3,6
O/P:19
Eg3) Array Elements - 1,6,4,7,9
O/P:10

+2 votes
how to find maximum sum of the contiguous elements in an array?

consider an example :
if an array is: 2 -1 2 4 6 -5
then maximum sum of contiguous array is 13, from index 0 to index 4
constraints: complexity must not be greater than O(n).

+1 vote
Find all pairs of from two arrays which adds up to a specific sum?

Say you are given 

int a[ ] = {1,2,3,4};
int b[ ] = {4,3,2,1};
int S = 5;

Now the task is to find all pairs of two number which adds up to S (One number from a and other number from b).

...