[Solution] Good Pairs solution codechef

Good Pairs solution codechef – You are given arrays $A$ and $B$ of length $N$ each. Determine the number of good pairs.

A pair $(i, j)$ $(1 \leq i, j \leq N)$ is said to be good if all of the following conditions are satisfied:

First line will contain $T$ , the number of test cases. Then the test cases follow.

Description of each test case:

First line contains an integer $N$ – denoting the length of the arrays.
Second line contains $N$ space-separated integers $A_{1}, A_{2}, \dots A_{N}$ – denoting the array $A$ .
Third line contains $N$ space-separated integers $B_{1}, B_{2}, \dots B_{N}$ – denoting the array $B$ .

For each test case, output the number of good pairs.

Test Case $1$ : The only good pair $(i, j)$ is $(1, 3)$ . Here,

Test Case $2$ : There are no good pairs.

Test Case $3$ : There are $3$ good pairs $(i, j)$ . These are $(1, 2), (1, 3),$ and $(2, 3)$ .

Test Case $4$ : There are $2$ good pairs $(i, j)$ . These are $(1, 2)$ and $(3, 4)$ .

For Solution