You are given an integer array nums and an integer k.
Return the length of the longest subarray whose elements sum to exactly k.

The subarray must be contiguous.

nums may contain positive, negative, and zero values.

If no such subarray exists, return 0.

Question

You are given an integer array nums and an integer k.
Return the length of the longest subarray whose elements sum to exactly k.

The subarray must be contiguous.

nums may contain positive, negative, and zero values.

If no such subarray exists, return 0.

Meta