Solutions to Leetcode 454. 4Sum II
Problem statement
Given four integer arrays nums1, nums2, nums3, and nums4 all of length n, return the number of tuples (i, j, k, l) such that:
0 <= i, j, k, l < n.
nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0.
Example 1
Input: nums1 = [1,2], num...
nhutnguyen.hashnode.dev3 min read