← ALL NOTES
Array

1865. Finding Pairs With a Certain Sum

Design a structure over nums1, nums2. add(index, val) adds val to nums2[index]. count(tot) returns the number of pairs (i, j) with nums1[i] + nums2[j] == tot. Many queries — count must be fast. Keep…

Loading…