Given four integer arrays nums1, nums2, nums3, and nums4, each of length n, return the total number of tuples (i, j, k, l) such that $0 \leq$ i, j, k, l $< n$ and:

nums1[i] $+$ nums2[j] $+$ nums3[k] $+$ nums4[l] $= 0$

Constraints:

• n == nums1.length

• n == nums2.length

• n == nums3.length

• n == nums4.length

• $1 \leq$ n $\leq 200$

• $-2^{28} \leq$ nums1[i], nums2[i], nums3[i], nums4[i] $\leq 2^{28}$

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.