🚀 Awesome Competitive Programming

*A stash of hidden gems that feel too good to be true. The legendary blogs,tricks, and tutorials that give you an advantage in Competitive Programming

---

📚 Table of Contents

• Math & Number Theory
• Graph Theory
• Dynamic Programming
• Data Structures
• Geometry
• General Tricks

---

Math & Number Theory

• GCD and LCM A collection of standard and tricky problems involving Greatest Common Divisor and Least Common Multiple.

• Chicken McNugget Theorem Explained A short explanation of the Frobenius Coin Problem (Chicken McNugget Theorem) useful for finding the largest non-representable number.

• Math Note — Möbius Inversion A tutorial on Möbius inversion, a crucial technique for solving combinatorial problems involving number theory.

Graph Theory

• DFS Tree Guide Understanding the properties of the DFS tree (back-edges, bridges, articulation points) is vital for advanced graph problems.

Dynamic Programming

• Non-trivial DP Tricks and Techniques A comprehensive guide covering advanced DP optimizations like Convex Hull Trick, Divide and Conquer Optimization, and more.

Data Structures

• Union of Intervals with Segment Tree Techniques for handling interval union problems efficiently using Segment Trees.

Geometry

• Geometry: 2D Points and Lines A foundational tutorial on handling 2D geometry, vector operations, and line intersections in programming.

⚡ General

• General CP Tricks A collection of tricks

---