Merge pull request #80 from arpitjain22june/patch-12

Create SumTriplet.java

Author: srsandy

Practice Problems/Arrays/Sum Triplet/Readme.md

@@ -0,0 +1,24 @@
+Take as input N, the size of array. Take N more inputs and store that in an array. Take as input “target”, a number. Write a function which prints all triplets of numbers which sum to target.
+
+Input Format
+First line contains input N.
+Next line contains N space separated integers denoting the elements of the array.
+The third line contains a single integer T denoting the target element.
+
+Constraints
+Length of Array should be between 1 and 1000.
+
+Output Format
+Print all the triplet present in the array in a new line each. The triplets must be printed as A, B and C where A,B and C are the elements of the triplet ( A<=B<=C) and all triplets must be printed in sorted order. Print only unique triplets.
+
+Sample Input
+9
+5 7 9 1 2 4 6 8 3
+10
+Sample Output
+1, 2 and 7
+1, 3 and 6
+1, 4 and 5
+2, 3 and 5
+Explanation
+Array = {5, 7, 9, 1, 2, 4, 6 ,8 ,3}. Target number = 10. Find any three number in the given array which sum to target number.

Practice Problems/Arrays/Sum Triplet/SumTriplet.java

@@ -0,0 +1,38 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class SumTriplet {
+//find triplet with sum =x 
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int n = 0;
+		if (sc.hasNext()) {
+			n = sc.nextInt();
+		}
+		
+		int[] a = new int[n];
+		for (int i = 0; i < n; i++) {
+			a[i] = sc.nextInt();
+		}
+		Arrays.sort(a);
+		int x = sc.nextInt();
+		for (int i = 0; i < n - 2; i++) {//loop for a fix number and rest like sum pair
+			int l = i + 1;
+			int h = n - 1;
+			while (l < h) {
+				int s = a[i] + a[l] + a[h];
+				if (s == x) {
+					System.out.println(a[i] + ", " + a[l] + " and " + a[h]);
+					l++;
+					h--;
+				} else if (s > x) {
+					h--;
+				} else {
+					l++;
+				}
+			}
+
+		}
+	}
+
+}