Package g0301_0400.s0318_maximum_product_of_word_lengths

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    318 - Maximum Product of Word Lengths.

    Medium

    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: 16

    Explanation: The two words can be "abcw", "xtfn".

    Example 2:

    Input: words = "a","ab","abc","d","cd","bcd","abcd"

    Output: 4

    Explanation: The two words can be "ab", "cd".

    Example 3:

    Input: words = "a","aa","aaa","aaaa"

    Output: 0

    Explanation: No such pair of words.

    Constraints:

    • 2 <= words.length <= 1000

    • 1 <= words[i].length <= 1000

    • words[i] consists only of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxProduct(Array<String> words)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait