Given an array containing **N** integers and an integer **K**. Your task is to find the length of the longest Sub-Array with sum of the elements equal to the given value **K**.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then **T** test cases follow. Each test case consists of two lines. First line of each test case contains two Integers **N** and **K** and the second line contains **N** space separated elements of the array.

**Output:**

For each test case, print the required lenght of the longest Sub-Array in new line. If no such sub array can be formed print 0.

**Constraints:**

1<=T<=500

1<=N,K<=10^{5}

-10^{5}<=A[i]<=10^{5}

**Example:
Input:**

3

6 15

10 5 2 7 1 9

6 -5

-5 8 -14 2 4 12

3 6

-1 2 3

4

5

0

TestCase 1:

```
Input : arr[] = { 10, 5, 2, 7, 1, 9 },
K = 15
Output : 4
The sub-array is
```**{5, 2, 7, 1}**.

Author: harshitsidhwa

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.

d_Coder00 | 163 |

VivSisMMM | 152 |

Astikeysingh | 148 |

Reetu_Kumari_MIT2018056 | 132 |

dungeon_master1299 | 126 |

Pulkit__Sharma__ | 658 |

Anirban166 | 531 |

abducodes | 518 |

Found_me | 494 |

Sathvik Avasarala | 466 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.