TripletSum.cpp

// You have been given a random integer array/list(ARR) and a number X. 
// Find and return the number of triplets in the array/list which sum to X.
// Note :
// Given array/list can contain duplicate elements.

//My Code
int tripletSum(int *input, int size, int x)
{
	int count = 0;
	for(int i=0; i<size; i++){
		for(int j=i+1; j<size; j++){
			for(int k=j+1; k<size; k++){
				if(input[i]+input[j]+input[k] == x){
					count++;
				}
			}
		}
	}
	return count;
}

// Main Code
#include <iostream>
using namespace std;

#include "solution.h"

int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		int size;
		int x;
		cin >> size;

		int *input = new int[size];

		for (int i = 0; i < size; i++)
		{
			cin >> input[i];
		}
		cin >> x;

		cout << tripletSum(input, size, x) << endl;

		delete[] input;
	}

	return 0;
}