Here is my C++ question:

Apply a C++ program to solve this problem.

Provided 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.

For example:

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

Sample output or Solution Set is:

[

[-1, 0, 1],

[-1, -1, 2]

]