README
¶
15. 3Sum (Medium)
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Note:
The solution set must not contain duplicate triplets.
Example:
Given array nums = [-1, 0, 1, 2, -1, -4], A solution set is: [ [-1, 0, 1], [-1, -1, 2] ]
Related Topics
[Array] [Two Pointers]
Similar Questions
- Two Sum (Easy)
- 3Sum Closest (Medium)
- 4Sum (Medium)
- 3Sum Smaller (Medium)
Hints
Hint 1
So, we essentially need to find three numbers x, y, and z such that they add up to the given value. If we fix one of the numbers say x, we are left with the two-sum problem at hand!Hint 2
For the two-sum problem, if we fix one of the numbers, sayx, we have to scan the entire array to find the next number
ywhich is
value - xwhere value is the input parameter. Can we change our array somehow so that this search becomes faster?
Hint 3
The second train of thought for two-sum is, without changing the array, can we use additional space somehow? Like maybe a hash map to speed up the search?
Documentation
¶
There is no documentation for this package.
Source Files
Click to show internal directories.
Click to hide internal directories.