Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

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.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.