All Posts

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.

季氏将伐颛臾。

All HTTP response status codes are separated into five classes or categories.

长沮、桀溺耦而耕。