1.
Introduction
2.
Standard Library
2.1.
Reading Inputs
2.2.
Output
2.3.
Linear Data Structures
2.3.1.
List
2.3.2.
Seq
2.3.3.
Array
2.3.4.
Stack
2.3.5.
Queue
2.4.
Non-linear Data Structures
2.4.1.
Functor
2.4.2.
OrderedType
2.4.3.
Map
2.4.4.
Set
2.4.5.
HashedType
2.4.6.
Hashtbl
2.5.
Labels
3.
Garbage Collection
4.
Functional Approaches
4.1.
Pipelining
4.2.
Map, Filter, Fold
4.3.
Currying
4.4.
Functor
4.5.
Option
4.6.
Monad
5.
Some Data Structures
5.1.
Tree
5.2.
Disjoint Set
5.3.
Priority Queue
6.
Some Algorithms
6.1.
Bisect
Light
Rust
Coal
Navy
Ayu
OCaml Problem Solving
Tree