How many distinct ascending triples are in an array

Practice this problem. Download Run Code. Python 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 Function to print all distinct triplets in the list with a sum less than or equal to a given number def printAllTriplets nums , total : sort the list in ascending order nums.

We can also solve this problem using backtracking , as shown below. Thanks to Tamara Vasylenko for suggesting this alternative approach. ArrayList ; import java. Arrays ; import java. Collections ; import java. Output: [[1, 2, 3], [1, 2, 4], [1, 2, 5], [1, 2, 7], [1, 3, 4], [1, 3, 5], [1, 4, 5], [2, 3, 4], [2, 3, 5]]. Rate this post. Average rating 4. Vote count: We use cookies to ensure you have the best browsing experience on our website.

Please read our cookie policy for more information about how we use cookies. Prepare NEW. Sample input: 6 1 1 2 2 3 4 Sample output: 4 Explanation The distinct triplets are 1,2,3 1,2,4 1,3,4 2,3,4 The elements of the array might not be sorted. Find the required answer. Return the required answer.

Recommended Articles. Count triplets i, j, k in an array of distinct elements such that a[i] a[k] and i. Count of triplets from the given Array such that sum of any two elements is the third element. Article Contributed By :. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide. Load Comments. What's New.