Given two arrays of integers nums1 and nums2, return the total number of valid triplets formed under the following conditions:

Type $1$: A triplet (i, j, k) where $0 \leq$ i $<$ nums1.length and $0 \leq$ j $<$ k $<$ nums2.length, such that nums1[i]$^2 ==$ nums2[j] $ imes$ nums2[k].

Type $2$: A triplet (i, j, k) where $0 \leq$ i $<$ nums2.length and $0 \leq$ j $<$ k $<$ nums1.length, such that nums2[i]$^2 ==$ nums1[j] $ imes$ nums1[k].

Constraints:

• $1 \leq$ nums1.length, nums2.length $\leq 1000$

• $1 \leq$ nums1[i], nums2[i] $\leq 10^5$

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.