Add solution #1147

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,153 LeetCode solutions in JavaScript
+# 1,154 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -901,6 +901,7 @@
 1144|[Decrease Elements To Make Array Zigzag](./solutions/1144-decrease-elements-to-make-array-zigzag.js)|Medium|
 1145|[Binary Tree Coloring Game](./solutions/1145-binary-tree-coloring-game.js)|Medium|
 1146|[Snapshot Array](./solutions/1146-snapshot-array.js)|Medium|
+1147|[Longest Chunked Palindrome Decomposition](./solutions/1147-longest-chunked-palindrome-decomposition.js)|Hard|
 1161|[Maximum Level Sum of a Binary Tree](./solutions/1161-maximum-level-sum-of-a-binary-tree.js)|Medium|
 1189|[Maximum Number of Balloons](./solutions/1189-maximum-number-of-balloons.js)|Easy|
 1200|[Minimum Absolute Difference](./solutions/1200-minimum-absolute-difference.js)|Easy|

solutions/1147-longest-chunked-palindrome-decomposition.js

@@ -0,0 +1,40 @@
+/**
+ * 1147. Longest Chunked Palindrome Decomposition
+ * https://leetcode.com/problems/longest-chunked-palindrome-decomposition/
+ * Difficulty: Hard
+ *
+ * You are given a string text. You should split it to k substrings (subtext1,
+ * subtext2, ..., subtextk) such that:
+ * - subtexti is a non-empty string.
+ * - The concatenation of all the substrings is equal to text (i.e., subtext1 + subtext2
+ *   + ... + subtextk == text).
+ * - subtexti == subtextk - i + 1 for all valid values of i (i.e., 1 <= i <= k).
+ *
+ * Return the largest possible value of k.
+ */
+
+/**
+ * @param {string} text
+ * @return {number}
+ */
+var longestDecomposition = function(text) {
+  return decompose(0, text.length - 1);
+
+  function decompose(start, end) {
+    if (start > end) return 0;
+    if (start === end) return 1;
+
+    const left = start;
+    const right = end;
+    let chunkSize = 0;
+
+    while (left + chunkSize < right - chunkSize) {
+      chunkSize++;
+      if (text.slice(left, left + chunkSize) === text.slice(right - chunkSize + 1, right + 1)) {
+        return 2 + decompose(left + chunkSize, right - chunkSize);
+      }
+    }
+
+    return 1;
+  }
+};