Given an array of digit strings nums and a digit string target, return the number of pairs of indices (i, j) such that i \neq j and the concatenation of nums[i] and nums[j] equals target.

Constraints:

• $2 \leq$ nums.length $\leq 100$

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

• $2 \leq$ target.length $\leq 100$

• nums[i] and target consist of digits.

• nums[i] and target do not have leading zeros.

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.