Competitive Programming C++ Templates

This repository contains my personal competitive programming code templates written in C++.
It is organized by topic so I can quickly find and reuse standard implementations during contests.

Repository Structure

Each folder contains multiple ready-to-use C++ codes for a specific topic, such as:

• Bit Manipulation
• DP
• DSU
• Geometry
• Graph
• Hashing
• LCA / Binary Lifting
• Number Theory
• Segment Tree
• String Algorithms
• Trie
• Others

Purpose

This repo helps me:

• Save time during programming contests
• Keep standard algorithms in one place
• Reuse tested implementations
• Stay organized by topic
• Quickly update or improve existing templates

Topics Covered

• Bit Manipulation
• Dynamic Programming
• Disjoint Set Union (DSU)
• Geometry
• Graph Algorithms
• Hashing
• Lowest Common Ancestor (LCA)
• Binary Lifting
• Number Theory
• Segment Tree
• String Algorithms
• Trie
• Other useful templates and tricks

How to Use

1. Open the folder of the topic you need.
2. Copy the required C++ code template.
3. Paste it into your contest solution.
4. Modify it according to the problem statement.
5. Compile and submit.

File Format

• All templates are written in C++
• Most files are designed for competitive programming use
• Code is kept short, fast, and practical
• Template names are based on the algorithm or technique they implement

Example Folder Layout

├── BIT 2D sum sparse table
├── Bit manipulation
├── DP
├── DSU
├── Geometry
├── Graph
├── Hashing
├── LCA, Binary Lefting
├── Number Theory
├── Others
├── Segment_Tree
├── String Algorithm
├── Trie
├── Template
└── README.md