Longest Contiguous Subarray Sum | Dataford Interview Questions

A Meta Platforms News Feed analysis job represents consecutive metric changes as an integer array. Given nums and a target sum k, return the length of the longest contiguous subarray whose elements sum exactly to k.

Values may be positive, negative, or zero. Return 0 if no qualifying subarray exists.

Formal Specification

Implement longest_subarray_sum_k(nums, k).

Input: nums, a list of integers, and k, an integer.
Output: An integer representing the maximum length of a contiguous subarray with sum k.
A subarray must contain consecutive elements, and each element may be used only within its original position.

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^14 <= k <= 10^14
nums may contain positive, negative, and zero values

Function Signature

def longest_subarray_sum_k(nums, k):

Your question is Longest Contiguous Subarray Sum. Start with the requirements in the Question tab.

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

Problem