Longest Subarray With Target Sum

Problem

Given an integer array nums and an integer target, return the length of the longest continuous subarray whose elements sum to target. If no such subarray exists, return 0. The array may contain positive numbers, negative numbers, and zeros.

Constraints

• 1 <= nums.length <= 10^5
• -10^4 <= nums[i] <= 10^4
• -10^9 <= target <= 10^9