Leetcode 318. Maximum Product of Word Lengths

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        words.sort(key=len, reverse=True)
        maximum = 0
        n = len(words)
        for i in range(n):
            for j in range(i+1, n):
                x = len(words[i])
                y = len(words[j])
                if maximum >= x * y:
                    return maximum
                intersection = set(words[i]) & set(words[j])
                if len(intersection) == 0:
                    maximum = max(maximum, x * y)
                    break
        return maximum

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        chars = [set(word) for word in words]
        maximum = 0
        n = len(words)
        for i in range(n):
            for j in range(i+1, n):
                x = len(words[i])
                y = len(words[j])
                intersection = chars[i] & chars[j]
                if len(intersection) == 0:
                    maximum = max(maximum, x * y)
        return maximum

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        lengths = [len(word) for word in words]
        flags = []
        for word in words:
            flag = 0
            for ch in word:
                flag = flag | (1 << (ord(ch) - 97))
            flags.append(flag)
        maximum = 0
        n = len(words)
        for i in range(n):
            for j in range(i+1, n):
                if flags[i] & flags[j] == 0:
                    maximum = max(maximum, lengths[i] * lengths[j])
        return maximum

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        maximum = 0
        mapping = {}
        for word in words:
            flag = 0
            for ch in word:
                flag = flag | (1 << (ord(ch) - 97))
            mapping[flag] = max(mapping.get(flag, 0), len(word))

        for key1, value1 in mapping.items():
            for key2, value2 in mapping.items():
                if key1 & key2 == 0:
                    maximum = max(maximum, value1 * value2)
        return maximum