Glossary: Coding Interviews

Topological sort, union-find, trie, bit tricks, Dijkstra

Also written: Topological sort, Union-find, Trie, tries, Bit tricks, bit manipulation, Dijkstra, Dijkstra's shortest paths

Less common techniques: topological sort orders tasks that depend on each other, union-find tracks groups that merge, a trie is a tree of letters for prefix search, bit tricks work on a number's binary digits, and Dijkstra finds shortest paths in weighted graphs.