# Problem Definition

## Description

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:**

```plaintext
Given array nums = [-1, 0, 1, 2, -1, -4],

A solution set is:
[
  [-1, 0, 1],
  [-1, -1, 2]
]
```

## Notes

1. [LifeInCode - Two Sum, 3 Sum, 3 Sum closest and 4 Sum](http://www.lifeincode.net/programming/leetcode-two-sum-3-sum-3-sum-closest-and-4-sum-java/)
1. [LeetCode discussion - Easiest Java Solution](https://leetcode.com/problems/3sum/discuss/7399/Easiest-Java-Solution)