Tag Archives: Pair Sum

This is the first problem listed on most coding platforms. Here’s the problem statement:Given an array of unique integers, find a pair 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: 9Output: -1, 10 Let’s dive into the solution:Continue reading “Scribble 0: Pair Sum”