A curated collection of topic-wise competitive programming solutions, algorithmic implementations, and data structure implementations.
This repository serves as an organized subset of my broader competitive programming archive. It is a curated selection of problems solved across various judges (Codeforces, LeetCode, SPOJ, CSES, LightOJ, etc.), structured systematically by topic to serve as a focused reference for complex algorithms and techniques.
The repository is structured into major categories. Click on any topic to explore the corresponding implementations and problem solutions.
- Arbitrary Precision Arithmetic
- Binary Exponentiation
- Bit Manipulation
- Euclidean GCD
- Fibonacci Numbers
- Linear Sieve
- Sieve of Eratosthenes
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Algorithm
- Bellman-Ford
- Floyd-Warshall
- Negative Cycle Detection
- Lowest Common Ancestor (LCA)
- Binary Lifting LCA
- Maximum Flow
- Minimum Spanning Tree (MST)
- Strongly Connected Components (SCC)
I rely on several excellent resources for learning and practice. These roadmaps and problem lists have been instrumental in my growth:
- cp-algorithms - Comprehensive algorithmic theory.
- YouKnowWho Academy Topic List - Structured topic list.
- USACO Guide - Excellent roadmap for competitive programming.
- CSES Problem Set - Standard problem set for practice.
- A2 Online Judge - Ladders and categorized problems.
Feel free to browse the directories to find implementations or solutions to specific problems. Each file is named after the problem or the algorithm it implements.
- Implementations: Files starting with
implementation_or located in subdirectories often contain clean, reusable templates. - Solutions: Problem solutions usually include the platform name and problem title (e.g.,
Codeforces_Fedor_and_New_Game.cpp).
A detailed log of solved problems and learning milestones is maintained here: My Google Sheet Progress Tracker
This is primarily a personal repository, but I am open to suggestions or corrections. If you find a bug in an implementation or a more optimized way to solve a problem, feel free to open an issue or submit a pull request.
This repository is licensed under the MIT License.