🧩 Algorithm Template Index

Welcome to the algorithm template hub!
This page serves as a central navigation point for all code templates used in algorithm problem solving. Each link leads to a detailed note with explanation, usage, and recommended practice problems.

---

📝 How to Use

Each page includes:

• ✅ Problem type and scenario
• 💡 Key insights and typical patterns
• 🔧 Annotated C++ implementation
• ⚡ Contest-ready C++ version
• 🧠 Usage tips + pitfalls
• 📋 Practice problem table (ABC/CF links)

---

📚 String Algorithms

• 🔁 Manacher's Algorithm
• 🔍 TODO - KMP Prefix Function
• 🔄 TODO - Z-Algorithm
• 🔎 TODO - Rolling Hash

---

🧮 Math & Bit Tricks

• ✖️ TODO - Modular Inverse / Power
• 🔢 TODO - Prefix XOR
• 🧠 TODO - Sieve of Eratosthenes
• 🧾 TODO - Bitmask Enumeration

---

🌳 Graph Algorithms

• 🚶 TODO - DFS / BFS
• 📦 Union Find / DSU
• 🛣 TODO - Dijkstra / SPFA
• 🧭 TODO - Topological Sort
• 🧿 TODO - Lowest Common Ancestor (LCA)

---

📐 Dynamic Programming

• 🎒 TODO - Knapsack Patterns
• 🧩 TODO - Bit DP
• 💡 TODO - Digit DP
• 🧵 TODO - DP on Strings

---

🔄 Other Templates

• 📈 TODO - Segment Tree
• 🧰 TODO - Fenwick Tree (BIT)
• 🔍 TODO - Two Pointers
• 💡 TODO - Sliding Window

---

Back to Home