You are given three positive integers num1, num2, and num3.

Pad each number with leading zeros so that each number consists of exactly $4$ digits.

The key is a $4$ digit number constructed by taking the minimum digit at each position among the three padded numbers:
The $i^{ ext{th}}$ digit of key ($1 \leq i \leq 4$) is the minimum among the $i^{ ext{th}}$ digits of num1, num2, and num3.

Return the key as an integer.

Constraints:

• $1 \leq$ num1, num2, num3 $\leq 9999$

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.