Four Sum II
Medium
Hashing
Given four integer arrays A, B, C and D of equal length n, print the number of tuples (i, j, k, l) such that A[i] + B[j] + C[k] + D[l] = 0.
Constraints
1 <= n <= 200 -2^28 <= value <= 2^28
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.