Two Sum Pair Finding Task

Given an array of integers ARR of length N and an integer Target, your objective is to find and return all pairs of distinct elements in the array that sum up to the Target.

Input:

integer T array length N, integer Target array ARR of length N

Output:

All pairs of elements (a, b) such that a + b = Target -1 -1 if no such pair exists

Example:

Input:

T = 1 N = 4, Target = 9 ARR = [2, 7, 11, 15]

Output:

2 7

Explanation:

The pair (2, 7) adds up to 9.

Constraints:

1

Question

Two Sum Pair Finding Task

Given an array of integers ARR of length N and an integer Target, your objective is to find and return all pairs of distinct elements in the array that sum up to the Target.

Input:

integer T
array length N, integer Target
array ARR of length N

Output:

All pairs of elements (a, b) such that a + b = Target
-1 -1 if no such pair exists

Example:

Input:

T = 1
N = 4, Target = 9
ARR = [2, 7, 11, 15]

Output:

2 7

Explanation:

The pair (2, 7) adds up to 9.

Constraints:

1 <= T <= 100
1 <= N <= 5000
-10⁹ <= Target <= 10⁹
-10⁹ <= ARR[i] <= 10⁹

Note:

Duplicate pairs are not allowed (e.g., (a, b) is the same as (b, a)). Each pair should be unique and can be printed in any order. Ensure not to use an element at an index more than once. The function to implement is already handled for output; focus on correctness.

Accepted Answer

Given an array of integers and a target integer, find and return all pairs of distinct elements that sum up to the target.

Iterate through the array and for each element, check if the difference between the target and the element exists in a hash set.
If it does, add the pair to the result set. If not, add the current element to the hash set.
Ensure not to use an element at an index more than once to avoid duplicate pairs.