Max Word Product

CodeChefOpen on judge ↗

Chef has been given an array word consisting of N strings, he wants to return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. Which means the strings word[i] and word[j] contain no common characters. If no such two words exist in the given array, Chef should return 0. ### Input - First line will contain $T$, number of testcases. Then the tes

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI