Longest Consecutive Substring Algorithm | Dataford Interview Questions

Write complete code to find the longest consecutive substring in an array.

Asked in the Technical HR stage. Full working code required.

Implement longest_consecutive_substring(nums), where nums is an array of integers. Return the longest contiguous subarray in which each value is exactly one greater than the previous value. If multiple subarrays have the same maximum length, return the earliest one. Return an empty array for empty input.

Example: nums = [4, 5, 6, 2, 3, 4, 5] returns [2, 3, 4, 5].

Constraints: 0 <= len(nums) <= 10^4; values are integers.

Constraints

0 <= len(nums) <= 10^4
Each element of nums is an integer
A consecutive run requires nums[i] == nums[i - 1] + 1
For equal maximum lengths, return the earliest run

Function Signature

def longest_consecutive_substring(nums):

Your question is Longest Consecutive Substring Algorithm. 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