Java Program to Count triplets with sum smaller than a given value
Last Updated :
29 Dec, 2021
Given an array of distinct integers and a sum value. Find count of triplets with sum smaller than given sum value. The expected Time Complexity is O(n2).
Examples:
Input : arr[] = {-2, 0, 1, 3}
sum = 2.
Output : 2
Explanation : Below are triplets with sum less than 2
(-2, 0, 1) and (-2, 0, 3)
Input : arr[] = {5, 1, 3, 4, 7}
sum = 12.
Output : 4
Explanation : Below are triplets with sum less than 12
(1, 3, 4), (1, 3, 5), (1, 3, 7) and
(1, 4, 5)
A Simple Solution is to run three loops to consider all triplets one by one. For every triplet, compare the sums and increment count if the triplet sum is smaller than the given sum.
Java
class Test
{
static int arr[] = new int []{ 5 , 1 , 3 , 4 , 7 };
static int countTriplets( int n, int sum)
{
int ans = 0 ;
for ( int i = 0 ; i < n- 2 ; i++)
{
for ( int j = i+ 1 ; j < n- 1 ; j++)
{
for ( int k = j+ 1 ; k < n; k++)
if (arr[i] + arr[j] + arr[k] < sum)
ans++;
}
}
return ans;
}
public static void main(String[] args)
{
int sum = 12 ;
System.out.println(countTriplets(arr.length, sum));
}
}
|
Output:
4
The time complexity of the above solution is O(n3). An Efficient Solution can count triplets in O(n2) by sorting the array first, and then using method 1 of this post in a loop.
1) Sort the input array in increasing order.
2) Initialize result as 0.
3) Run a loop from i = 0 to n-2. An iteration of this loop finds all
triplets with arr[i] as first element.
a) Initialize other two elements as corner elements of subarray
arr[i+1..n-1], i.e., j = i+1 and k = n-1
b) Move j and k toward each other until they meet, i.e., while (j= sum
then k--
// Else for current i and j, there can (k-j) possible third elements
// that satisfy the constraint.
(ii) Else Do ans += (k - j) followed by j++
Below is the implementation of the above idea.
Java
import java.util.Arrays;
class Test
{
static int arr[] = new int []{ 5 , 1 , 3 , 4 , 7 };
static int countTriplets( int n, int sum)
{
Arrays.sort(arr);
int ans = 0 ;
for ( int i = 0 ; i < n - 2 ; i++)
{
int j = i + 1 , k = n - 1 ;
while (j < k)
{
if (arr[i] + arr[j] + arr[k] >= sum)
k--;
else
{
ans += (k - j);
j++;
}
}
}
return ans;
}
public static void main(String[] args)
{
int sum = 12 ;
System.out.println(countTriplets(arr.length, sum));
}
}
|
Output:
4
Please refer complete article on Count triplets with sum smaller than a given value for more details!
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...