Tag Archives: Three Number Sum

Here’s the problem statement:Given an array of unique integers, find all triplets of distinct integers (in any order) that add up to a given target sum. For example:The array: 4, 19, 8, 6, -1, 15, 10Target sum: 13Output: [[4, -1, 10,], [-1, 6, 8]] Let’s dive into the solution: We can extend the approaches usedContinue reading “Scribble 1: Triplet Sum”