Maximum Product of Word Lengths
Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0.
Example 1
Input
words = ["abcw","baz","foo","bar","xtfn","abcdef"]Output
16The two words can be "abcw" and "xtfn", whose lengths multiply to 16.
Example 2
Input
words = ["a","ab","abc","d","cd","bcd","abcd"]Output
4The two words can be "ab" and "cd", whose lengths multiply to 4.
Constraints
- 2 <= words.length <= 1000
- 1 <= words[i].length <= 1000
- words[i] consists only of lowercase English letters.