Prefix/Suffix array and Difference array
A prefix sum array stores the running total of an input sequence so that any
Mono Queue and Mono Stack
A monotonic stack is a stack whose contents are kept in strictly increasing
Priority Queue
A priority queue is an abstract data type that supports inserting elements
Sorted Containers
A sorted container maintains a collection of elements in sorted order while
Forward Star
Forward star is a compressed adjacency representation for directed graphs
Trie
A trie (prefix tree) is a rooted tree in which every edge is labelled by a
DCEL (Doubly Connected Edge List)
The doubly connected edge list (DCEL) is the standard representation for a