Split Sorted Array Into Sequences | Dataford Interview Questions

Given a sorted array of integers, find the sequences of consecutive integers (for example, [4,5,7,9,10,12] returns [4,5], [7], [9,10], [12]). Return a list of lists containing every maximal consecutive sequence, preserving input order and including singleton values. Implement find_sequences(nums), where nums is a sorted list of distinct integers and the result is a list of integer lists. Return [] for an empty input. Assume 0 <= len(nums) <= 10^4 and values fit within standard integer range.

Constraints

0 <= nums.length <= 10^4
nums is sorted in strictly increasing order
Each nums[i] is an integer

Function Signature

def find_sequences(nums):

Your question is Split Sorted Array Into Sequences. 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

0 <= nums.length <= 10^4
nums is sorted in strictly increasing order
Each nums[i] is an integer

Function Signature

def find_sequences(nums):

Your question is Split Sorted Array Into Sequences. 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.