Arrays

In Part I of the “Two Number Sum” problem series, my partner soniasusanto took you through the brute force solution as well as an optimized approach that uses sorting and pointers to improve the time complexity.

This marks the beginning of Sooinc’s and my pair programming journey to solve this problem from AlgoExpert. Suppose we have a function that takes in an array of distinct integers and an integer that represents the target sum. How do we find any two integers in the input array that will…