# Competitive-Programming

**Repository Path**: dandelight/Competitive-Programming

## Basic Information

- **Project Name**: Competitive-Programming
- **Description**: Forked from https://github.com/ncduy0303/Competitive-Programming
My own templates and implementation of important algorithms and data structures for competitive programming
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: https://ncduy0303.github.io/Competitive-Programming/
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-12-04
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# Competitive Programming
My own templates and implementation of important algorithms and data structures for competitive programming


My profile: [Codeforces](https://codeforces.com/profile/caoduy73)

## Contest templates
  - [My template C++](Contest%20Template/main.cpp)

## Graph
  - Graph Traversing ([DFS](Graphs/Graph%20Traversal/DFS.cpp), [BFS](Graphs/Graph%20Traversal/BFS.cpp))
  - [Flood Fill](Graphs/Graph%20Traversal/Flood%20Fill.cpp)
  - Minimum Spanning Tree ([Kruskal](Graphs/Minimum%20Spanning%20Tree/Kruskal.cpp), [Prim](Graphs/Minimum%20Spanning%20Tree/Prim.cpp))
  - Shortest Paths ([Dijkstra](Graphs/Shortest%20Paths/Dijkstra.cpp), [Bellman-Ford](Graphs/Shortest%20Paths/Bellman_Ford.cpp), [0-1 BFS](Graphs/Shortest%20Paths/0-1%20BFS.cpp), [Floyd Warshall](Graphs/Shortest%20Paths/Floyd_Warshall.cpp))
  - [Bridges and Articulation Points](Graphs/Strongly%20Connected%20Components%20(SSCs)/Bridges&ArticulationPoints.cpp)
  - Strongly Connected Components ([Tarjan](Graphs/Strongly%20Connected%20Components%20(SSCs)/Tarjan.cpp), [Kosaraju](Graphs/Strongly%20Connected%20Components%20(SSCs)/Kosaraju.cpp))
  - [Bipartite Matching](Graphs/Graph%20Traversal/Bipartite.cpp)
  - Topological Sort ([DFS](Graphs/Topological%20Sort/Topological%20Sort%20(DFS).cpp), [in_deg](Graphs/Topological%20Sort/Topological%20Sort%20(in_deg).cpp))
  - Maximum FLow ([Edmonds-Karp](Graphs/Max%20Flow/Edmonds_Karp.cpp), [Dinic](Graphs/Max%20Flow/Dinic.cpp))
  - Lowest Common Ancestor ([Binary Lifting](Graphs/Lowest%20Common%20Ancestor/LCA%20(Binary%20Lifting).cpp), [RMQ](Graphs/Lowest%20Common%20Ancestor/LCA%20(RMQ).cpp))
  
## Dynamic Programming
  - [0-1 Knapsack](Dynamic%20Programming/(0-1)%20Knapsack.cpp)
  - [Coin Change](Dynamic%20Programming/Coin%20Change.cpp)
  - Max Sum Subarray: [1D](Dynamic%20Programming/1D%20Max%20Sum%20(Kanade).cpp), [2D](Dynamic%20Programming/2D%20Max%20Sum.cpp)
  - [Longest Common Subsequence](Dynamic%20Programming/Longest%20Common%20Subsequence%20(LCS).cpp)
  - [Longest Increasing Subsequence](Dynamic%20Programming/Longest%20Increasing%20Subsequence%20(LIS).cpp)
  - [Digit DP](Dynamic%20Programming/Digit%20DP.cpp)
  - [Weighted Job Scheduling](Dynamic%20Programming/Weighted%20Job%20Scheduling.cpp)
  - [Cutting Sticks](Dynamic%20Programming/Cutting%20Sticks.cpp)
  - [Matrix Chain](Dynamic%20Programming/Matrix%20Chain.cpp)
  - [Elevator Rides](Dynamic%20Programming/Elevator%20Rides.cpp)
  - [Convex Hull Trick](Dynamic%20Programming/Convex%20Hull%20Trick%20&%20Li-Chao%20Segment%20Tree.cpp)
  - [Travelling Salesman Problem](Dynamic%20Programming/Traveling%20Salesman%20Problem%20(TSP).cpp)
  
## Data Structure
  - [Sparse Table](Data%20Structures/Sparse%20Table.cpp)
  - [Fenwick Tree](Data%20Structures/Fenwick%20Tree/Fenwick%20Tree%20(point%20update,%20range%20query).cpp)
  - [Segment Tree](Data%20Structures/Segment%20Tree/Segment%20Tree%20(Recursive).cpp)
  - [SQRT Decomposition + Mo's Algoithm](Data%20Structures/SQRT.cpp)
  - [Disjoint Set Union](Data%20Structures/DSU.cpp)
  - [Trie](Data%20Structures/Trie.cpp)
  - [Suffix Array](Data%20Structures/Suffix%20Array.cpp)
  - [Policy-based data structures C++ STL](Data%20Structures/PBDS.cpp)
  - [Heavy Light Decomposition](Data%20Structures/HLD.cpp)
  
## String Algorithm
  - Pattern Searching ([KMP](String%20Processing/KMP%20(Prefix%20function).cpp), [Z-Algorithm](String%20Processing/Z-algo%20(Z%20function).cpp), [Rabin-Karp](String%20Processing/String%20Hashing%20(Rabin-Karp).cpp))
  
## Number Theory
  - [Sieve of Eratosthenes](Mathematics/Sieve%20Of%20Eratosthenes.cpp)
  - [Greatest Common Divisor (Euclidean Algorithm)](Mathematics/GCD.cpp)
  - [Quick Exponentiation](Mathematics/Quick%20Exponention.cpp)
  - [Fibonancci](Mathematics/Fibonancci.cpp)
  - [Binomial Coefficients](Mathematics/Binomial%20Coefficients.cpp)

## Computational Geometry
  - Sweep Line: [Closet Pairs](Geometry/Sweep%20Line/Closest%20Pairs.cpp), [Rectangle Union](Geometry/Sweep%20Line/Rectangle%20Union.cpp)
  
## Other Classic Problems
  - [N-queen](Others/N%20Queens.cpp)
  - [Median Heap](Others/Median%20Heap.cpp)
  - [Maximum Histogram Area](Others/Maximum%20Histogram%20Area%20(Monotonic%20Stack).cpp)
  - [Meet In The Middle](Others/Meet%20In%20The%20Middle.cpp)
  - [2-SAT](Others/2SAT.cpp)
  - [Offline Dynamic Connectivity](Others/Offline%20Dynamic%20Connectivity.cpp)
  - [Closest Points (Divide & Conquer)](/Others/Closest_3_Points(Divide&Conquer).cpp)