Welcome to the Advanced Data Structures & Algorithms repository! 🚀
This repository is a collection of some of the most efficient and widely used data structures and algorithms tailored for competitive programming. From Binary Lifting to Segment Trees, each section offers carefully implemented solutions and explanations to help you ace your next coding challenge. Its goal is simplicity and it was created in order to help beginners understand more advanced data structures. Sites like Usaco often provide complicated and not commented code. Therefore, anyone contributing should keep that in mind.
Binary Lifting: Efficient ancestor queries in logarithmic time.
Euler Tour: Powerful techniques for tree traversals.
Segment Trees: Dynamic range queries for arrays.
Sparse Tables: Simplify range minimum queries with static arrays.
- HLD
- SCC
- String algo's (Z, KMP, Manacher's
- Union Find
Competitive Programmers 🏆
Algorithm Enthusiasts 💡
Computer Science Students 👩💻👨💻
Clone the repo:
bash
git clone https://github.com/sergio-sak/Advanced-Data-Structures-Algorithms.git
Explore the individual modules, and feel free to contribute or experiment with your own implementations.
C++: The foundation of all the implementations.
Feel free to open issues, suggest features, or contribute directly to improve the repository! For more info on the codes' format, check the files already pushed.
== If you have any questions feel free to reach out to me through github or discord: sergio.sak ==