Given a $2 D$ integer array arrays where each subarray arrays[i] is sorted in strictly increasing order, return an array containing the longest common subsequence present across all the given arrays.

The elements in the resulting array must also be in strictly increasing order.

Constraints:

• $2 \leq$ arrays.length $\leq 100$

• $1 \leq$ arrays[i].length $\leq 100$

• $1 \leq$ arrays[i][j] $\leq 100$

• arrays[i] is sorted in strictly increasing order.

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.