Moderate $-\frac{980}{80}.$ Average time to solve is $30m$

$($c$)$

Contributed by Amit

$386$ upvates

Asked in companies

Problem statement

Send feedback

Ninja and his friend are playing a game of subarrays. They have an array 'NUMS' of length $\text{'}$N$\text{'}$: Ninja's friend gives him an arbitrary integer $\text{'}K\text{'}$ and asks him to find the length of the longest subarray in which the sum of elements is equal to $K$ :

Ninjas asks for your help to win this game Find the length of the longest subarray in which the sum of elements is equal to $K.$

If there is no subarray whosesum is $\text{'}K$ : then you should return $0.$

Example:

input: $N^{\text{'}}=5,*K^{\text{'}}=4\frac{,}{N}UMS=[1,2,1,0,1]$

Output: $4$

There are two subarrays with $5$ um $=4,[1,2,1]$ and $2,1,0,4$ Hence the fength of the longest subarray with sum $=4$ is $4$