#131. Palindrome Partitioning

https://leetcode.com/problems/palindrome-partitioning/?envType=daily-question&envId=2024-05-24

/**
 * @param {string} s
 * @return {string[][]}
 */
var partition = function(s) {
    const result = [];

    const isPalindrome = (str, left, right) => {
        while (left < right) {
            if (str[left] !== str[right]) {
                return false;
            }
            left++;
            right--;
        }
        return true;
    };

    const backtrack = (start, path) => {
        if (start === s.length) {
            result.push([...path]);
            return;
        }

        for (let end = start; end < s.length; end++) {
            if (isPalindrome(s, start, end)) {
                path.push(s.substring(start, end + 1));
                backtrack(start + end - start + 1, path);
                path.pop();
            }
        }
    };

    backtrack(0, []);
    return result;
};