All Posts

Given the roots of two binary trees `root` and `subRoot`, return `true` if there is a subtree of `root` with the same structure and node values of `subRoot` and `false` otherwise.

Given the roots of two binary trees `p` and `q`, write a function to check if they are the same or not.

将为胠箧 (1) 探囊发匮 (2) 之盗而为守备，则必摄缄縢 (3) ，固扃 (4) ，此世俗之所谓知也 (5) 。

Given the `root` of a binary search tree, and an integer `k`, return the `kth` smallest value (**1-indexed**) of all the values of the nodes in the tree.

庖丁 (1) 为文惠君 (2) 解牛，手之所触，肩之所倚，足之所履，膝之所踦 (3) ，然 (4) 响然，奏刀然 (5) ，莫不中音。

When install `pyca/cryptography` on MacOS with python `2.

北冥 (1) 有鱼，其名为鲲。

Design a data structure that supports adding new words and finding if a string matches any previously added string.

鱼，我所欲也；熊掌，亦我所欲也： 二者不可得兼，舍鱼而取熊掌者也。