Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@shashi1iitk | 398 |

@Suniti Jain | 114 |

@ankish2000nayak | 104 |

@gopalsethlnct | 94 |

@senthil1185 | 90 |

@esmadhan | 90 |

@gyanadipta07 | 89 |

@satwikdash2000 | 85 |

@varunmishra3040 | 83 |

@gamec1634 | 82 |

@pj_1721 | 80 |

Complete Leaderboard |

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.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Triplet Sum in Array

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.