Largest Consecutive Subarray | Dataford Interview Questions

Given an array, find the largest subarray that contains consecutive elements (by value).

Treat the values as reorderable, so a valid subarray may not be sorted, but it must contain distinct integers with no gaps. Return the inclusive [start, end] indices of the longest valid subarray; if multiple subarrays tie, return the one with the smallest starting index. Assume the array is non-empty.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Return inclusive zero-based indices
A valid subarray must contain distinct values

Function Signature

def longest_consecutive_subarray(nums):

Your question is Largest Consecutive Subarray. 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

Given an array, find the largest subarray that contains consecutive elements (by value).

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Return inclusive zero-based indices
A valid subarray must contain distinct values

Function Signature

def longest_consecutive_subarray(nums):

Your question is Largest Consecutive Subarray. 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.