Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0. Example…

public class Solution { public int MaxProduct(string[] words) { ) { ; } int len = words.Length; int[] value = new int[len]; ; i < len; i++) { string tmp = words[i]; value[i] = ; ; j < tmp.Length; j++) { value[i] |= << (tmp[j] - 'a'); } } ; ; i…