All Classes and Interfaces
Classes
Class
Description
Provides static methods for efficient algorithmic operations
like binary search and ternary search on arrays and lists.
Represents a node in a binary search tree (BST) for elements of a comparable type.
The Calc class provides a series of static methods for performing various mathematical
computations like modular inverses, exponentiation, factorial, combinations,
greatest common divisor (GCD), least common multiple (LCM), and Euler's Totient function.
Constants provides a central location to keep commonly used constants and configurations
in competitive programming.
Provides utility methods for data manipulation, including finding minimum and maximum values,
calculating prefix and suffix sums, and performing binary search operations on arrays and lists.
Represents a Disjoint Set Union (DSU) also known as Union-Find data structure.
This class provides methods for input operations from various sources such as system input, files, and streams,
and supports the parsing of primitive types and strings, including array and list formats.
Represents a node in a doubly linked list, which can be navigated in both directions: forward and backward.
This class serves as a utility for output operations, allowing for redirection
of output streams, file output, custom delimiters, and built-in support for printing
various data types, including arrays and collections.
The
Pair class stores two related objects of potentially different types.The
Quad class stores four related objects of potentially different types.A generic segment tree implementation that provides efficient range query and point update operations.
A
Single is designed to hold an object of a generic type A.A Trie (or Prefix Tree) data structure implementation that supports efficient
insertion and search operations for strings.
The
Triple class stores three related objects of potentially different types.