You are given a $1$ indexed integer array nums of length n containing distinct elements.

You need to distribute all elements of nums into two arrays, arr1 and arr2, across n operations:

• In the first operation, append nums[1] to arr1.

• In the second operation, append nums[2] to arr2.

• For each subsequent $i^{ ext{th}}$ operation where $3 \leq i \leq$ n:

  • If the last element of arr1 is greater than the last element of arr2, append nums[i] to arr1.

  • Otherwise, append nums[i] to arr2.

Return the array formed by concatenating arr1 and arr2.

Constraints:

• $3 \leq$ n $\leq 50$

• $1 \leq$ nums[i] $\leq 100$

• All elements in nums are distinct.

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.