You are given two arrays of positive integers, arr1 and arr2.

A prefix of a positive integer is an integer formed by one or more of its digits, starting from the leftmost digit. For example, $123$ is a prefix of $12345$, while $234$ is not.

A common prefix of two integers $a$ and $b$ is an integer $c$, such that $c$ is a prefix of both $a$ and $b$. For example, $5655359$ and $56554$ have common prefixes $565$ and $5655$ while $1223$ and $43456$ do not have a common prefix.

You need to find the length of the longest common prefix between all pairs of integers (x, y) such that x belongs to arr1 and y belongs to arr2.

Return the length of the longest common prefix among all such pairs. If no common prefix exists, return $0$.

Note: Common prefixes between elements within the same array do not count.

Constraints:

• $1 \leq$ arr1.length, arr2.length $\leq 5 \times 10^4$

• $1 \leq$ arr1[i], arr2[i] $\leq 10^8$

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.