Given an array of integers, find all pairs of integers that sum to number N.  This is implemented with 2 approaches: 1) Stepping through the array and saving differences between each value and N into a Map (val, N-val), or 2) By keeping 2 pointers to the first and last elements in the array and checking whether the sum matches N.