codelibrary in Kotlin.
Most of them have been automatically converted by IDEA and haven't been verified. Please refer to the original java versions if you have any trouble.
Many thanks to the original author of codelibrary, indy256.
- Segment tree c++ java kotlin kotlin
- Segment tree without recursion c++ java kotlin
- 2d tree c++ java kotlin
- Fenwick tree c++ java kotlin kotlin
- Fenwick tree with extended operations c++ java kotlin
- Persistent tree java kotlin kotlin
- Centroid decomposition c++ java kotlin
- Heavy/light decomposition c++ java kotlin
- Link/cut tree c++ java kotlin
- Link/cut tree for connectivity query java kotlin
- Link/cut tree for LCA query java kotlin
- Binary heap java kotlin
- Binary heap with change priority c++ java kotlin
- Disjoint sets c++ java kotlin
- Treap c++ java kotlin kotlin
- Treap with indexed key c++ java kotlin
- k-d tree for point query c++ java kotlin
- k-d tree for rectangular query java kotlin
- R-tree java kotlin
- Metric tree java kotlin
- Quadtree java kotlin
- Mergeable heap java kotlin
- Queue with minimum c++ java kotlin
- Sparse table c++ java java kotlin
- Sparse segment tree c++
- Wavelet tree c++ java kotlin
- Mo's algorithm java kotlin
- Mo's algorithm with point updates c++
- Shortest paths c++ java kotlin
- Maximum flow c++ java kotlin
- Maximum matching c++ java kotlin
- Spanning tree c++ java kotlin
- Connectivity c++ java kotlin
- Biconnectivity java kotlin
- LCA Schieber-Vishkin algorithm c++ java kotlin
- LCA java kotlin
- Planarity testing (contribute a link or implementation)
- Dynamic graph connectivity (contribute a link or implementation)
- Chu–Liu/Edmonds' algorithm (contribute a link or implementation)
- Minimum augmentation to strong connectivity (contribute a link or implementation)
- Minimum augmentation to biconnectivity (contribute a link or implementation)
- Knuth-Morris-Pratt algorithm c++ java kotlin
- Aho-Corasick algorithm c++ java kotlin
- Suffix array and lcp array. Radix sort algorithm in O(n*log(n)) c++ java kotlin
- Suffix array. Algorithm DC3 in O(n) c++ java kotlin
- Suffix array. Algorithm SA-IS in O(n) c++
- Suffix automaton c++ java kotlin
- Suffix tree Ukkonen's algorithm c++ java kotlin
- Suffix tree Breslauer-Italiano algorithm c++
- Trie java kotlin
- Z-function c++ java kotlin
- Hashing c++ java kotlin
- Parsing java c++ kotlin
- Palindrome tree (contribute a link or implementation)
- Sorting strings in linear time (contribute a link or implementation)
- Segments intersection c++ java kotlin
- Line operations java kotlin
- Circle operations java kotlin
- Convex hull c++ java kotlin
- Point in polygon query c++ java kotlin
- Closest pair of points java kotlin
- Furthest pair of points c++
- Implement quaternion (contribute a link or implementation)
- Fast Fourier transform (FFT) c++ java kotlin
- Long arithmetics c++
- Fast subset convolution java kotlin
- Fast Walsh-Hadamar transform java kotlin
- Karatsuba multiplication java kotlin
- Newton interpolation java kotlin
- Laguerre's root-finding algorithm c++
- Primes and divisors java c++ kotlin
- Factorization java c++ kotlin
- Euclidean algorithm java c++ kotlin
- Primitive root c++
- Discrete logarithm c++
- Discrete root c++
- Multiplicative function java kotlin
- Rational numbers java kotlin
- Polynom class c++
- Linear recurrence and Berlekamp-Massey algorithm c++
- Modular operations c++