Pair Sum Problem Statement

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

Note:

Each pair should be ordered such that the first value is less than or equal to the second value. The list of pairs should be sorted in non-decreasing order based on their first values. If two pairs have the same first value, the pair with the smaller second value should come first.

Input:

N S ARR[0] ARR[1] ... ARR[N-1]

Output:

C x1 y1 x2 y2 ...

Example:

Input:

N = 5, S = 7 ARR = [3, 1, 2, 4, 5]

Output:

[2, 5] [3, 4]

Constraints:

1 ≤ N ≤ 10³

-10⁵ ≤ ARR[i] ≤ 10⁵

-2 * 10⁵ ≤ S ≤ 2 * 10⁵

Time Limit: 1 sec

Note:

You don't need to print the output; just implement the logic to return the required result.

Question

Pair Sum Problem Statement

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

Note:

Each pair should be ordered such that the first value is less than or equal to the second value. The list of pairs should be sorted in non-decreasing order based on their first values. If two pairs have the same first value, the pair with the smaller second value should come first.

Input:

N S
ARR[0] ARR[1] ... ARR[N-1]

Output:

C
x1 y1
x2 y2
...

Example:

Input:

N = 5, S = 7
ARR = [3, 1, 2, 4, 5]

Output:

[2, 5]
[3, 4]

Constraints:

1 ≤ N ≤ 10³
-10⁵ ≤ ARR[i] ≤ 10⁵
-2 * 10⁵ ≤ S ≤ 2 * 10⁵

Time Limit: 1 sec

Note:

You don't need to print the output; just implement the logic to return the required result.

Accepted Answer

Pair Sum
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.
Note:
Each pair should be sorted i.e the first value should be less than or equals to the second value. Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Input Format:
The first line of input contains two space-separated integers 'N' and 'S', denoting the size of the input array and the value of 'S'. The second and last line of input contains 'N' space-separated integers, denoting the elements of the input array: ARR[i] where 0 <= i <

Accepted Answer

https://private-user-images.githubusercontent.com/77439575/317751414-5d9c7e06-e12f-4a48-97b7-83da5727255c.png?jwt=eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.eyJpc3MiOiJnaXRodWIuY29tIiwiYXVkIjoicmF3LmdpdGh1YnVzZXJjb250ZW50LmNvbSIsImtleSI6ImtleTUiLCJleHAiOjE3MTE2MzQ1NTYsIm5iZiI6MTcxMTYzNDI1NiwicGF0aCI6Ii83NzQzOTU3NS8zMTc3NTE0MTQtNWQ5YzdlMDYtZTEyZi00YTQ4LTk3YjctODNkYTU3MjcyNTVjLnBuZz9YLUFtei1BbGdvcml0aG09QVdTNC1ITUFDLVNIQTI1NiZYLUFtei1DcmVkZW50aWFsPUFLSUFWQ09EWUxTQTUzUFFLNFpBJTJGMjAyNDAzMjglMkZ1cy1lYXN0LTElMkZzMyUyRmF3czRfcmVxdWVzdCZYLUFtei1EYXRlPTIwMjQwMzI4VDEzNTczNlomWC1BbXotRXhwaXJlcz0zMDAmWC1BbXotU2lnbmF0dXJlPWM1YWQzZDI1YmU5MjljN2Y4OWMwNGViNDliMTM3MWQ5ZDhhYzg5ZTA0MGUzOGQ4MTI3NjAzNDI3NjY1MTIwZmEmWC1BbXotU2lnbmVkSGVhZGVycz1ob3N0JmFjdG9yX2lkPTAma2V5X2lkPTAmcmVwb19pZD0wIn0.WptGrXj0r_Gjo1eUeDPj8SGJA6YpUH-4y2wJiEMglQk