@@ -0,0 +1,1067 @@
+package com.codewriters.fdiba.array;%0A%0A%0Aimport java.util.Scanner;%0A%0A%0A/**%0A * Find all subsets %7Ba, b, c%7D in a given set of integers S that a + b + c = 0.%0A * %0A * @author Aleksandar Savev %3Csavevjr@gmail.com%3E%0A * @since 25-Jan-16%0A */%0Apublic class SubSets%0A%7B%0A%0A    public static void main(String%5B%5D args)%0A    %7B%0A        // example input: 1,2,3,-1,-2,-3,0,4,5%0A        Scanner s = new Scanner(System.in);%0A        String%5B%5D setString = s.nextLine().split(%22,%22);%0A        s.close();%0A%0A        int%5B%5D set = new int%5BsetString.length%5D;%0A        for (int i = 0; i %3C set.length; i++)%0A        %7B%0A            set%5Bi%5D = Integer.parseInt(setString%5Bi%5D);%0A        %7D%0A%0A        for (int i = 0; i %3C set.length - 2; i++)%0A        %7B%0A            for (int j = i + 1; j %3C set.length - 1; j++)%0A            %7B%0A                for (int k = j + 1; k %3C set.length; k++)%0A                %7B%0A                    if (set%5Bi%5D + set%5Bj%5D + == -set%5Bk%5D)%0A                    %7B%0A                        System.out.println(set%5Bi%5D + %22, %22 + set%5Bj%5D + %22, %22 + set%5Bk%5D);%0A                    %7D%0A                %7D%0A            %7D%0A        %7D%0A    %7D%0A%7D%0A

Add SubSet task