* @lc app=leetcode id=131 lang=javascript
* [131] Palindrome Partitioning
function isPalindrom(s) {
let right = s.length - 1;
while (left < right && s[left] === s[right]) {
function backtrack(s, list, tempList, start) {
const sliced = s.slice(start);
if (isPalindrom(sliced) && tempList.join("").length === s.length)
list.push([...tempList]);
for (let i = 0; i < sliced.length; i++) {
const sub = sliced.slice(0, i + 1);
backtrack(s, list, tempList, start + i + 1);
var partition = function (s) {
backtrack(s, list, [], 0);