You are given a $2 D$ integer array groups of length n and an integer array nums.

You need to determine if it is possible to choose n disjoint subarrays from nums such that the $i^{ ext{th}}$ chosen subarray is identical to groups[i], and the chosen subarrays appear in nums in the exact same relative order as they appear in groups.

Return true if you can choose n such disjoint subarrays, or false otherwise.

Note: Two subarrays are considered disjoint if they do not share any common elements (their index ranges in nums do not overlap).

Constraints:

• groups.length $= n$

• $1 \leq$ n $\leq 10^3$

• $1 \leq$ groups[i].length, $\sum$ groups[i].length $\leq 10^3$

• $1 \leq$ nums.length $\leq 10^3$

• $-10^7 \leq$ groups[i][j], nums[k] $\leq 10^7$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.