Solving Two Sum II - Input Array Is Sorted

To see the question, click here. Naive Approach The idea is to check all possible pairs to ensure that the sum of the numbers at those pointers equals the target. So, maintain two pointers i and j at the first two positions of the array and return th...