alldroll

// https://leetcode.com/problems/find-the-closest-palindrome/submissions/

import (
	"strconv"
	"strings"
)

const (
	zero = byte('0')
	nine = byte('9')

alldroll

func isMatch(s string, p string) bool {
    n, m := len(s), len(p)
    dp := make([][]bool, n+1)
    
    for i := n; i >= 0; i-- {
        dp[i] = make([]bool, m+1)
    }
    
    dp[n][m] = true
    

alldroll

// https://leetcode.com/problems/unique-binary-search-trees-ii/

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/unique-binary-search-trees-ii

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/unique-binary-search-trees

func numTrees(n int) int {
    if n == 0 {
        return 1
    }
    
    memorized := make([][]int, n + 2)
    
    for i, _ := range memorized {

alldroll

// https://leetcode.com/problems/validate-binary-search-tree

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/binary-tree-level-order-traversal

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/path-sum-ii

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */

alldroll

// https://leetcode.com/problems/flatten-binary-tree-to-linked-list
/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
func flatten(root *TreeNode)  {