@@ -0,0 +1,612 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/maximum-product-of-word-lengths/%0A */%0Apublic class Problem318 %7B%0A    public int maxProduct(String%5B%5D words) %7B%0A        // TODO:%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem318 prob = new Problem318();%0A        System.out.println(prob.maxProduct(new String%5B%5D%7B%22abcw%22, %22baz%22, %22foo%22, %22bar%22, %22xtfn%22, %22abcdef%22%7D)); // 16%0A        System.out.println(prob.maxProduct(new String%5B%5D%7B%22a%22, %22ab%22, %22abc%22, %22d%22, %22cd%22, %22bcd%22, %22abcd%22%7D)); // 4%0A        System.out.println(prob.maxProduct(new String%5B%5D%7B%22a%22, %22aa%22, %22aaa%22, %22aaaa%22%7D)); // 0%0A    %7D%0A%7D%0A

Add skeleton for problem 318