Find Triplets with Given Sum Problem Statement

Given an array ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a given integer K.

Explanation:

An array contains a triplet {ARR[i], ARR[j], ARR[k]} summing to K if there exist three indices i, j, and k such that i != j, j != k, and i != k, while satisfying ARR[i] + ARR[j] + ARR[k] = K.

Input:

T  # Number of test cases
N  # Size of the array
ARR  # Array elements (space-separated integers)
K  # Target sum for the triplets

Output:

For each test case, print each valid triplet on a new line or return an empty list if no such triplet exists, which will be indicated by "-1" in the output.

Example:

Input:

2
5
1 2 3 4 5
9
6
-1 0 1 2 -1 -4
0

Output:

2 3 4
-1 0 1
-1 2 -1

Constraints:

• 1 <= T <= 50
• 1 <= N <= 10³
• -10⁶ <= ARR[i] <= 10⁶
• -10⁹ <= K <= 10⁹
• Time Limit: 1 second

Note:

You are not required to print anything; the output mechanism is handled for you. Just implement the function to process the input and determine triplets.