D. J.:

- Added the leetcode problem and solution for 318

Author: nobodyPerfecZ

README.md

@@ -223,6 +223,7 @@
 - [295 Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/description/)
 - [300 Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/description/)
 - [309 Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)
+- [318 Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/description/)
 - [322 Coin Change](https://leetcode.com/problems/coin-change/description/)
 - [337 House Robber III](https://leetcode.com/problems/house-robber-iii/description/)
 - [338 Counting Bits](https://leetcode.com/problems/counting-bits/description/)

awesome_python_leetcode/_318_maximum_product_of_word_lengths.py

@@ -0,0 +1,29 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def maxProduct(self, words: List[str]) -> int:
+        """
+        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.
+        """
+        n = len(words)
+        masks = [0] * n
+
+        # Create bitmask for each word
+        for i, word in enumerate(words):
+            mask = 0
+            for ch in word:
+                mask |= 1 << (ord(ch) - ord("a"))
+            masks[i] = mask
+
+        result = 0
+        for i in range(n):
+            for j in range(i + 1, n):
+                # If no common letters, bitwise AND will be 0
+                if masks[i] & masks[j] == 0:
+                    result = max(result, len(words[i]) * len(words[j]))
+        return result

tests/test_318_maximum_product_of_word_lengths.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._318_maximum_product_of_word_lengths import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["words", "expected"],
+    argvalues=[
+        (["abcw", "baz", "foo", "bar", "xtfn", "abcdef"], 16),
+        (["a", "ab", "abc", "d", "cd", "bcd", "abcd"], 4),
+        (["a", "aa", "aaa", "aaaa"], 0),
+    ],
+)
+def test_func(words: List[str], expected: int):
+    """Tests the solution of a LeetCode problem."""
+    max_product = Solution().maxProduct(words)
+    assert max_product == expected