This repository contains my collection of competitive programming solutions and setup. The code is organized by topics, making it easy to find and reference solutions quickly.

1. Number Theory
2. Graph
3. Dynamic Programming
4. Math
5. Recursion
6. Geometry
7. Segment Tree

• GCD (Greatest Common Divisor):

  • File: gcd.cpp
  • Description: Implementation of the Euclidean algorithm to find the GCD of two numbers.

• Sieve of Eratosthenes:

  • File: sieve.cpp
  • Description: Efficient algorithm to find all prime numbers up to a given limit.

...

and so on .......

Feel free to contribute by adding new algorithms, optimizations, or improvements. Follow these steps:

1. Fork the repository.
2. Create a new branch: git checkout -b feature/new-algorithm.
3. Commit your changes: git commit -m "Add new algorithm".
4. Push to the branch: git push origin feature/new-algorithm.
5. Submit a pull request.

Happy coding! 🚀