Given two integer arrays nums1 and nums2 of sizes n and m respectively, calculate two values:

• The number of indices i such that nums1[i] occurs at least once in nums2.

• The number of indices i such that nums2[i] occurs at least once in nums1.

Return an integer array answer of size $2$ containing the two calculated values in that order.

Constraints:

• n == nums1.length

• m == nums2.length

• $1 \leq$ n, m $\leq 100$

• $1 \leq$ nums1[i], nums2[i] $\leq 100$

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.