This repository contains C++ templates for various algorithms and data structures.
- AVL Tree
- Centroid Decomposition
- Finding Subsegment with Maximum Sum
- Convex Hull
- Dynamic Segment Tree
- MinHeap / MaxHeap
- Heavy-Light Decomposition (HLD)
- Huffman Coding
- Line Sweep
- Lowest Common Ancestor (LCA)
- Sparse Table
- K-D Tree
- Treap Segment Tree
- Treap Binary Search Tree
These templates are designed to be easily integrated into your C++ files.Most of them are inside structures. Simply copy the desired template files into your file. Some of the templates includes detailed comments explaining its functionality and usage.
Contributions are welcome! If you have improvements, bug fixes, or additional templates to add, please feel free to open a pull request.
This repository does not provide any specific license. You are free to use, modify, and distribute the code for personal or commercial projects without any restrictions.
Happy coding!