Find 2 strings with no common letters and maximized length product
Given a mapping from phone number prefixs to addresses, find the address
given a phone number
Maximum sub-array using divide-and-conquer