Given a list of strings, each string can be one of the 4 following types:

We are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.)

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.

In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or blank space. These characters divide the square into contiguous regions.

A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.

Two strings S and T are special-equivalent if after any number of moves, S == T.

如果二叉树每个节点都具有相同的值，那么该二叉树就是单值二叉树。 只有给定的树是单值二叉树时，才返回 true；否则返回 false。 示例1： {代码…} 示例2： {代码…} 提示： 给定树的节点数范围是 [1, 100]。 …

Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.

Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.