You are given an array of strings words.
Your task is to find the maximum product of the lengths of two words that do not share any common letters.
If no such pair exists, return 0.
Input: words = ["lamp","quiz","book","flow","dry","pen"]
Output: 16
Input: words = ["hi","world","data","code","key"]
Output: 12
Accepted:
Submission: