CodingLibrary

A collection of code snippets for data structures and algorithms used in competitive programming.

C++ Implementations

Graph Algorithms

• Articulation Points
• Bellman-Ford
• Bridges
• Dijkstra's Algorithm
• Floyd-Warshall
• Kruskal's MST
• Prim's MST
• Topological Sort
• Topological Sort (DFS)

Tree Algorithms

• Tree Diameter
• Heavy-Light Decomposition
• Heavy-Light Decomposition (Edge)
• LCA Binary Lifting

Range Queries

• Binary Indexed Tree (BIT)
• Efficient Segment Trees
• Lazy Segment Tree
• Sparse Table
• Segment Tree

String Algorithms

• LCP Array
• Suffix Array
• Minimum Rotation
• Prefix Function

Data Structures

• Disjoint Set Union (DSU)

Number Theory

• Binary Exponentiation

Miscellaneous

• Matrix Operations
• Mo's Algorithm

Java Implementations

• Solution Template

Structure

├── C++/                   # C++ algorithm implementations
├── Java/
│   └── Template/
│       └── src/           # Java templates and solutions
└── README.md

Usage

Each snippet is self-contained and can be directly integrated into competitive programming solutions. The Java template provides a starting point for problem-solving.

Contributing

This library is actively maintained and updated with new algorithms and optimizations.

License

This project is licensed under the MIT License - see the LICENSE file for details.

---

Rajdeep Deb