while this is the idea, I believe you need a hasmap with occurrences as values. Imagine you have 12 3 4 5 and sum is 10. With a hashmap you will get pair (5,5) which is not correct since there is only one 5 in the array. By the way, the exact sum and binary tree lcs questions were asked at IBM interview as well. Funny!