Hash Map Array Problem | Dataford Interview Questions

Atos service-monitoring pipelines process arrays of signed event deltas. Given an integer array and a target sum, return the start and end indices of the longest contiguous subarray whose elements add up to the target.

If multiple longest subarrays exist, return the one with the smallest start index. Return [] if no qualifying subarray exists.

Formal Specification

Implement longest_subarray_sum(nums, target).

Input: nums, a list of integers, and target, an integer.
Output: A two-element list [start, end] containing inclusive zero-based indices, or [] when no solution exists.

The array may contain negative numbers, zeroes, and positive numbers, so a sliding-window approach is not generally valid.

Constraints

1 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
-10^9 <= target <= 10^9
Return inclusive zero-based indices
Return the earliest segment when maximum lengths are tied

Function Signature

def longest_subarray_sum(nums, target):

Your question is Hash Map Array Problem. 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