tag

#two-sum

2 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 454: 4Sum II

Problem Restatement We are given four integer arrays: nums1 nums2 nums3 nums4 All four arrays have the same length n . We need to count how many tuples (i, j, k, l) satisfy: 0 <= i, j, k, l < n and: nums1[i] + nums2[j] + nums3[k] + nums4[l] == 0 The task asks for the number of valid index tuples, not the tuples themselves. The official statement defines the...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 1: Two Sum

Problem Restatement We are given an array of integers called nums and an integer called target . We need to find two different positions in the array such that the two numbers at those positions add up to target . Return the two indices. The same element cannot be used twice. That means if nums[i] is used as the first number, we need another index j , where i !=...