Problem 318. Maximum Product of Word Lengths [Medium] - Intro to Bitmasking

Description 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. Initial Attempt My initial attempts were at trying to see if ...