Given two integer arrays A and B of equal length n, define an array C of length n such that for each index i, C[i] equals the count of values that appear in both prefixes A[0..i] and B[0..i] (count each value at most once).

Return the array C.

Note: A and B are permutations of the integers from $1$ to n.

Constraints:

• $1 \leq$ A.length $==$ B.length $==$ n $\leq 50$

• $1 \leq$ A[i], B[i] $\leq$ n

• It is guaranteed that A and B are both a permutation of n integers.

Input: A = [1,3,2,4]-List[int], B = [3,1,2,4]-List[int]
Output: [0,2,3,4]-List[int]
Explanation: At i = 0, prefixes {1} and {3} share 0 values (C[0]=0); at i = 1, {1,3} and {3,1} share {1,3} (C[1]=2); at i = 2, {1,3,2} and {3,1,2} share {1,2,3} (C[2]=3); and at i = 3, {1,3,2,4} and {3,1,2,4} share {1,2,3,4} (C[3]=4).

Input: A = [2,1,3,5,4]-List[int], B = [1,2,3,4,5]-List[int]
Output: [0,2,3,3,5]-List[int]
Explanation: At i = 0, {2} vs {1} has 0 in common; at i = 1, {2,1} vs {1,2} shares {1,2} (2); at i = 2, {2,1,3} vs {1,2,3} shares {1,2,3} (3); at i = 3, {2,1,3,5} vs {1,2,3,4} shares {1,2,3} (3); and at i = 4, {2,1,3,5,4} vs {1,2,3,4,5} shares {1,2,3,4,5} (5).

Input: A = [1]-List[int], B = [1]-List[int]
Output: [1]-List[int]
Explanation: At i = 0, the prefixes are {1} and {1}, so the common count is 1.

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.