Leetcode Problem 318. Maximum Product of Word Lengths

318. Maximum Product of Word Lengths

Leetcode Solutions

Initialize an array masks to store the bitmask of each word and an array lens to store the lengths of the words.
For each word, compute its bitmask by setting the bit corresponding to each character present in the word.
Store the computed bitmask and the length of the word in masks and lens respectively.
Initialize maxProd to 0 to keep track of the maximum product.
Iterate over all pairs of words. For each pair, use the precomputed bitmasks to check if they have no common letters by verifying (masks[i] & masks[j]) == 0.
If they have no common letters, calculate the product of their lengths and update maxProd if the product is greater.
Return maxProd as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen