Two sum pair

April 21, 2016

Work on algorithm called two sum pair.

Problem statement:
https://www.careercup.com/question?id=12887674

Given an array. Find pairs of numbers that add up to a given value 'x'. with time complexity less than O(n^2) and use no additional space.

Also, Array Pair Sum, look up the google:
http://www.ardendertat.com/2011/09/17/programming-interview-questions-1-array-pair-sum/

work on this hackerRank problem to entertain the time:
https://www.hackerrank.com/contests/infinitum8/challenges/pairwise-sum-and-divide

Moderate level
https://www.hackerrank.com/challenges/sherlock-and-pairs