You are given an array of strings A of size N. You need to pick two strings Ai and Aj such that len(Ai)* len(Aj) is maximized. Is there a optimal solution that can be less than order of N*N? Thanks in advance.