2) Binary Search
1) while (low <= high)
2) mid = low + high-low/2 ; // to avoid overflow
3) Implement LRU Cache
http://www.geeksforgeeks.org/implement-lru-cache/
4) Given a string “{ab}{}{{dhk}}” write a program to find if the parenthesis are balanced.