Create 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.kt

Author: a93a

kotlin/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.kt

@@ -0,0 +1,34 @@
+class Solution {
+    fun maxProduct(s: String): Int {
+        val hm = HashMap<Int, Int>()
+
+        for (mask in 1 until (1 shl s.length)) {
+            val sb = StringBuilder()
+
+            for (i in 0 until s.length) {
+                if (mask and (1 shl i) > 0) {
+                    sb.append(s[i])
+                } 
+            }
+
+            val p = sb.toString()
+            if (p == p.reversed()) {
+                hm.put(mask, p.length)
+            }
+        }
+
+        var max = 0
+        for (mask1 in hm.keys) {
+            for (mask2 in hm.keys) {
+                if (mask1 and mask2 == 0) {
+                    max = maxOf(
+                        max,
+                        hm[mask1]!! * hm[mask2]!!
+                    )
+                }
+            }
+        }
+
+        return max
+    }
+}