Showing:
Handle Score
@Ibrahim Nash 5761
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4944
@saiujwal13083 4506
@sanjay05 3762
@marius_valentin_dragoi 3516
@sushant_a 3459
@verma_ji 3341
@KshamaGupta 3318
Find all pairs with a given sum
Easy Accuracy: 12.53% Submissions: 224 Points: 2

Given two unsorted arrays A of size N and B of size M of distinct elements, the task is to find all pairs from both arrays whose sum is equal to X.

Example 1:

Input :
A[] = {1, 2, 4, 5, 7}
B[] = {5, 6, 3, 4, 8}
X = 9
Output :
1 8
4 5
5 4
Explanation :
(1, 8), (4, 5), (5, 4) are the
pairs which sum to 9.


Example 2:
Input :
A[] = {-1, -2, 4, -6, 5, 7}
B[] = {6, 3, 4, 0}
X = 8
Output :
4 4
5 3


You don't need to read input or print anything. Your task is to complete the function allPairs() which takes the array A[], B[], its size N and M respectively and an integer as inputs and returns the sorted vector pair values of all the pairs u,v where u belongs to array A and v belongs to array B. If no such pair exist return empty vector pair.

Expected Time Complexity: O(N.Log(N))
Expected Auxiliary Space: O(N)

Constraints:
1 ≤ N, M, X ≤ 106
-106 ≤ A, B ≤ 106