# Given an integer array A, and an integer target, return the number of tuples i, j, k such that i < j < k and A[i] + A[j] + A[k] == target. # As the answer can be very large, return it modulo 10^9 + ...
a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. #318 / 318 test cases passed. #Runtime: 5752 ms #Memory Usage: 17.4 MB #Runtime: 5752 ms, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results