Given an array S of n integers, are there elements a, b, c in S such that a + b

Question

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? write a function to 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 S = [-1, 0, 1, 2, -1, -4],

A solution set is:

[   [-1, 0, 1],    [-1, -1, 2]   ]

return the set for this as an array or arrays

return null for fail cases

keep in mind time comlpexity and explain if using a hashset is in the better interest (can use hashset for algorithm)

write written algorithm to how you solved it with words

type please

comment each line of code

c++

give test cases

Explanation / Answer

#include using namespace std; // Prints all triplets in arr[] with 0 sum void findTriplets(int arr[], int n) { bool found = true; for (int i=0; i

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.