Skip to content

This repository contains multiple algorithms starting from basic topic (Number Theory) to advanced algorithms

Johnnas12/competitive-programming

Repository files navigation

Competetive Programming

This repository contains solutions and notes for a wide range of algorithms, starting from basic number theory to advanced topics. It is designed for competitive programming practice and learning.

Contents

  • Number Theory
    • Binary Exponentiation
    • Primes, GCD, LCM
    • Modular Arithmetic
    • Sieve Algorithms
  • Combinatorics
    • Permutations & Combinations
    • Binomial Coefficients
  • Data Structures
    • Arrays, Linked Lists
    • Trees, Graphs
  • Algorithms
    • Sorting & Searching
    • Dynamic Programming
    • Graph Algorithms (BFS, DFS, Dijkstra, etc.)
    • Advanced Topics (Segment Trees, Fenwick Trees, etc.)

How to Use

Browse the folders for code samples and explanations. Each topic includes practice problems and solutions.

Contributing

Feel free to submit pull requests for improvements or new algorithms.

About

This repository contains multiple algorithms starting from basic topic (Number Theory) to advanced algorithms

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages