Maximum Product of Word Lengths

Medium · Bit Manipulation · about 20 minutes

Asked at Google, Amazon, Microsoft.

Given an array of lowercase words, return the maximum value of len(words[i]) * len(words[j]) over pairs of words that share no common letters, or 0 if no such pair exists.