<ul><li>The problem is to find a triplet in an unsorted array that sums up to a given value.</li><li>Two approaches to solve this problem are using three loops/brute force approach and an optimized approach using hashing.</li><li>In the brute force approach, three nested for loops are used to check for triplets that sum up to the given value.</li><li>In the optimized approach, a set is used to check if the remaining part of the triplet exists in the set.</li></ul>

Arrays: Find a triplet that sum to a given value

Discover more