Second version of the unique BST problem. Minor syntactic  optimization.
First version of the two sum problem.

Hashmap-based solution, time complexity is O(n), and so is the space complexity