Algorithms and Data Structures

A comprehensive collection of competitive programming and computer science algorithms and data structures implemented in C++.

📂 Repository Structure

📊 Data Structures

Advanced containers for efficient data management.

• Fibonacci Heap – Fast mergeable priority queue.
• Lazy Binomial Heap – Efficient heap operations with lazy meld.
• Lazy Segment Tree – Range updates (add) and range queries (sum).
• Trie Tree – Prefix tree for fast string retrieval.

🌐 Graph Algorithms

• Traversal: BFS, DFS, Topological Sort.
• Shortest Path: Dijkstra.
• Spanning Tree: Kruskal (MST).
• Connectivity: Kosaraju (SCC), Union Find.

🔢 Math Algorithms

• Prime Numbers: Sieve of Eratosthenes.
• Fast Operations: Fast Exponentiation, FFT (Fast Fourier Transform).
• Number Theory: GCD (Euclidean), Modular Division, Fibonacci (Logarithmic time).

📝 Text Algorithms

• Pattern Matching: KMP (Knuth-Morris-Pratt).