- Notifications
You must be signed in to change notification settings - Fork 366
/
Copy pathFindTripletSum.java
93 lines (74 loc) · 2.62 KB
/
FindTripletSum.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
// Triplet Sum
// You have been given a random integer array/list(ARR) and a number X. Find and return the number of triplets in the array/list which sum to X.
// Note :
// Given array/list can contain duplicate elements.
// Input format :
// The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.
// First line of each test case or query contains an integer 'N' representing the size of the first array/list.
// Second line contains 'N' single space separated integers representing the elements in the array/list.
// Third line contains an integer 'X'.
// Output format :
// For each test case, print the total number of triplets present in the array/list.
// Output for every test case will be printed in a separate line.
// Constraints :
// 1 <= t <= 50
// 0 <= N <= 10^2
// 0 <= X <= 10^9
// Time Limit: 1 sec
// Sample Input 1:
// 1
// 7
// 1 2 3 4 5 6 7
// 12
// Sample Output 1:
// 5
// Sample Input 2:
// 2
// 7
// 1 2 3 4 5 6 7
// 19
// 9
// 2 -5 8 -6 0 5 10 11 -3
// 10
// Sample Output 2:
// 0
// 5
// Explanation for Input 2:
// Since there doesn't exist any triplet with sum equal to 19 for the first query, we print 0.
// For the second query, we have 5 triplets in total that sum up to 10. They are, (2, 8, 0), (2, 11, -3), (-5, 5, 10), (8, 5, -3) and (-6, 5, 11)
packageArray;
importjava.util.Scanner;
publicclassFindTripletSum {
publicstaticint [] takeInput() {
Scannersc = newScanner(System.in);
System.out.println("Enter the length of the element: ");
intn = sc.nextInt();
int [] arr = newint[n];
System.out.println("Enter the elements of the array: ");
for (inti = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
returnarr;
}
publicstaticinttripletSum(int [] arr, intx) {
intcount = 0;
for (inti = 0; i < arr.length; i++) {
for (intj = i + 1; j < arr.length; j++) {
for (intk = j + 1; k < arr.length; k++) {
if ( arr[i] + arr[j]+ arr[k] == x) {
count += 1;
}
}
}
}
returncount;
}
publicstaticvoidmain(String[] args) {
int [] arr = takeInput();
Scannersc = newScanner(System.in);
System.out.println("Enter the required number for triplet sum: ");
intx = sc.nextInt();
intn = tripletSum(arr, x);
System.out.println("Total number of triplet is: " + n);
}
}