Associated Course(s):
Interview Preparation

Given an array **A[]** of **N** numbers and another number **x**, determine whether or not there exist three elements in A[] whose sum is exactly x.

**Input:**

First line of input contains number of testcases T. For each testcase, first line of input contains n and x. Next line contains array elements.

**Output:**

Print 1 if there exist three elements in A whose sum is exactly x, else 0.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{3}

1 ≤ A[i] ≤ 10^{5}

**Example:**

**Input:**

2

6 13

1 4 45 6 10 8

5 10

1 2 4 3 6

**Output:**

1

1

**Explanation:
Testcase 1:** There is one triplet with sum 13 in the array. Triplet elements are 1, 4, 8, whose sum is 13.

Author: kartik

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

:)) | 186 |

Change_UserHandle | 183 |

shivam2303 | 176 |

PankajChhabra1 | 174 |

Boruto_Uzumaki | 136 |

KapilChhipa | 582 |

sagarsagar | 502 |

mb1973 | 475 |

AKASH24497 | 466 |

AmanDeepSingh97 | 465 |

blackshadows | 5254 |

Ibrahim Nash | 5192 |

akhayrutdinov | 5111 |

Quandray | 4385 |

mb1973 | 3912 |

Login to report an issue on this page.