Leetcode 1764. Form Array by Concatenating Subarrays of Another Array
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.