Available question text
Check if you can locate each groups[i] as a contiguous, non-overlapping subarray of nums in the same order as groups. Essentially it's an ordered pattern-matching problem: find successive disjoint occurrences of each group within nums.
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 1764. Form Array by Concatenating Subarrays of Another Array
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source