Available question text
Given a sorted integer array, determine whether you can partition its elements into one or more disjoint subsequences that are strictly consecutive (difference 1) and each have length at least 3. This is a greedy/greedy-like feasibility problem of assigning counts to extend or start consecutive runs.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 659. Split Array into Consecutive Subsequences
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source