You are given two integer arrays, nums1 and nums2, of lengths m and n, respectively. Each array represents the digits of a number.

You are also given an integer k. Create the largest possible number of length k (where k $\leq$ m $+$ n) using digits from both arrays. You may interleave digits from the two arrays, but the relative order of digits within the same array must be preserved.

Return an array of k digits representing the maximum number.

Constraints:

• m $=$ nums1.length

• n $=$ nums2.length

• $1 \leq$ m, n $\leq 500$

• $0 \leq$ nums1[i], nums2[i] $\leq 9$

• $1 \leq$ k $\leq$ m $+$ n

• nums1 and nums2 do not have leading zeros.

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 on how to solve this problem.

Implement your solution in the following coding playground.