New update is available. Click here to update.

Topics

You are given an array * 'a'* of size

Find the length of the longest subarray of 'a' whose sum is equal to 'k'.

```
Input: ‘n’ = 7 ‘k’ = 3
‘a’ = [1, 2, 3, 1, 1, 1, 1]
Output: 3
Explanation: Subarrays whose sum = ‘3’ are:
[1, 2], [3], [1, 1, 1] and [1, 1, 1]
Here, the length of the longest subarray is 3, which is our final answer.
```

Detailed explanation

```
7 3
1 2 3 1 1 1 1
```

```
3
```

```
Subarrays whose sum = ‘3’ are:
[1, 2], [3], [1, 1, 1] and [1, 1, 1]
Here, the length of the longest subarray is 3, which is our final answer.
```

```
4 2
1 2 1 3
```

```
1
```

```
5 2
2 2 4 1 2
```

```
1
```

```
The expected time complexity is O(n).
```

```
1 <= 'n' <= 5 * 10 ^ 6
1 <= 'k' <= 10^18
0 <= 'a[i]' <= 10 ^ 9
Time Limit: 1-second
```