Longest Subarray With Target Sum

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Longest Subarray With Target Sum. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

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

Function Signature

def longest_subarray_with_sum(nums, target):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output