Longest Subarray With Condition | Dataford Interview Questions

Given an array of integers, find the longest subarray that satisfies a specific condition. For this task, the condition is that the subarray's sum is less than or equal to zero. Implement longest_nonpositive_subarray(nums), returning the maximum length as an integer, or 0 when no such subarray exists. For example, [3, 4, -7, 1, 2, -6, 4] returns 6, and [1, 2, 3] returns 0.

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
A valid subarray must be contiguous
Return only the maximum length, not the subarray itself

Function Signature

def longest_nonpositive_subarray(nums):

Your question is Longest Subarray With Condition. 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

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
A valid subarray must be contiguous
Return only the maximum length, not the subarray itself

Function Signature

def longest_nonpositive_subarray(nums):

Your question is Longest Subarray With Condition. 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.