Skip to content

Instantly share code, notes, and snippets.

@jeremiahbiard
Created July 11, 2015 19:13
Show Gist options
  • Save jeremiahbiard/a8013488af8bf6bc48b4 to your computer and use it in GitHub Desktop.
Save jeremiahbiard/a8013488af8bf6bc48b4 to your computer and use it in GitHub Desktop.
Beginner: Linked List, Stack, Queue, Binary Search Tree.
Intermediate: Heap, Priority Queue, Huffman Tree, Union Find, Tries, Hash Table, Tree Map.
Proficient: Segment Tree, Binary Indexed Tree, Suffix Array, Sparse Table, Lowest Common Ancestor, Range Tree.
Expert: Suffix Automaton, Suffix Tree, Heavy-Light Decomposition, Treap, Aho-Corasick, K-d tree, Link-Cut Tree, Splay Tree, Palindromic Tree, Rope, Dancing Links, Radix Tree, Dynamic Suffix Array.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment