PuzzlersWorld.com

Problem Statement: Given a set S of n integers find all possible subsets(a,b,c) such that a + b + c = 0. Solution: Brute force approach is of O(n^4) but we can solve it in O(n^2) by using the approach in Non duplicate pairs that sum to S. First … [Continue reading]