FUJITSU Hiring | Campus Interview Question | On-Campus OA (2023)

Q1: Maximum Product of Word Lengths Problem Statement You are given an array of strings words. Return the maximum value of: length(words[i]) × length(words[j]) such that the two words do not share any common letters. If no such pair exists, return 0. Example Input: words = ["abcw","baz","foo","bar","xtfn","abcdef"] Output: 16 Explanation: "abcw" and "xtfn" have no common characters. Product = 4 × 4 = 16, which is the maximum possible. Constraints 2 <= words.length <= 1000 1 <= words[i].length <= 1000 ...