Skip to content

Practice Check Array Formation Through Concatenation

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1640
LeetCode Problem

Check Array Formation Through Concatenation

Problem Statement

You are given an array of distinct integers arr and an array of integer arrays pieces, where the integers in pieces are distinct. Your goal is to form arr by concatenating the arrays in pieces in any order. However, you are not allowed to reorder the integers in each array pieces[i]. Return true if it is possible to form the array arr from pieces. Otherwise, return false.

Source: Check Array Formation Through Concatenation on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
arr = [15,88], pieces = [[88],[15]]
Output
true

# Example 2

Input
arr = [49,18,16], pieces = [[16,18,49]]
Output
false

# Example 3

Input
arr = [91,4,64,78], pieces = [[78],[4,64],[91]]
Output
true

Constraints

1 <= pieces.length <= arr.length <= 100
sum(pieces[i].length) == arr.length
1 <= pieces[i].length <= arr.length
1 <= arr[i], pieces[i][j] <= 100
The integers in arr are distinct.
The integers in pieces are distinct (i.e., If we flatten pieces in a 1D array, all the integers in this array are distinct).

Related LeetCode Problems

Practice more problems similar to Check Array Formation Through Concatenation.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.