All Posts

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

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

A trie (pronounced as "try") or **prefix tree** is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.

齐人有一妻一妾而处室者，其良人出，则必餍酒肉而后反。

have as well as making otherwise unattainable product requirements feasible.

天时不如地利 (1) ，地利不如人和 (2) 。

Caching can be implemented in the following layers.

公输盘为楚造云梯 (1) 之械，成，将以攻宋。

Strings are the most basic kind of Redis value.

季氏将伐颛臾。