HackPoint

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)

HackPoint

function permute(word, pattern, permutations = []) {
    if(word.length === 0) {
        permutations.push(pattern);
    }

    for(let i = 0; i < word.length; i++) {
        let char = word[i];

        let left = word.slice(0, i);
        let right = word.slice(i + 1);

HackPoint

import {
  BrowserRouter,
  Navigate,
  useNavigate,
  useRoutes,
} from "react-router-dom";
import { ErrorBoundary } from "src/components/ErrorBoundary";
import { PageLayout } from "src/components/pageLayout/pageLayout";
import {
  BooksContextProvider,