Given two arrays of unique digits nums1 and nums2, return the smallest number that contains at least one digit from each array.

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 9$

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

• All digits in each array are unique.

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.