LiveAlgorithmFebruary 2024
Competitive Programming Toolkit
A curated toolkit of algorithm templates and data structure implementations built during competitive programming practice. Includes segment trees, graph algorithms, dynamic programming patterns, and number theory utilities.
Overview
A curated toolkit of algorithm templates and data structure implementations built during competitive programming practice. Includes segment trees, graph algorithms, dynamic programming patterns, and number theory utilities.
Architecture
Modular C++ templates organized by algorithm category. Each template is self-contained, tested against known problems, and optimized for contest time constraints.
Key Features
What makes this project stand out.
Segment tree with lazy propagation
Graph algorithms (Dijkstra, Floyd-Warshall, MST)
Dynamic programming pattern library
Number theory utilities
Contest I/O optimization templates
Tech Stack
Technologies used to build this project.
C++PythonJava
Lessons Learned
Key takeaways from building this project.
1Template reuse saves critical seconds in contests
2Understanding complexity is more valuable than memorization
3Edge cases reveal algorithmic understanding gaps