This curriculum has been developed to learn Algorithms to use in Competitive Programming, but can also be used for:
- Practicing for Interviews
- Improving Algorithmic Thinking
- Practicing for College Classes
Estimated time required for a week is 6-7 hours. (To complete the curriculum in the given time)
Basic usage guide: Using this repository depends on what the user wants to do with it. Here we are suggesting the following for people who want to slowly gain knowledge of the topics while continuing their studies etc.:
- Check out the written or video sources provided for a given topic depending on the preference. Go over as many as needed to gain a good understanding of the topic.
- Without checking the source code, try to replicate the algorithm or data structure on your own.
- When stuck or when done, look at the source codes provided, and compare them with yours to see what might be your mistake. Try to fix it.
- After you feel comfortable with the code, try to solve the given problems.
- When you are done with solving or are stuck at some point, check given solutions and try to understand your mistake or see if a better approach exists.
Here are some of the websites/tools that we use through this curriculum:
If you have anything to add, do not hesitate to offer! You can submit a PR or an issue; I will try to review all.
Here are the topics we will upload this year to include in the curriculum.
- C++ STL
-
Number Theory
- Prime Numbers (Sieve of Eratosthenes)
- GCD and LCM Euclid’s Algorithm
- Modular Exponentiation
- Long arithmetic (Multi, Add)
- Efficient Prime Factorization
-
Combinatorics (Probability-Combinations-Permutations-Matrix..)
- Binary Search
- Ternary Search
-
Graph Theory
- Depth First Search (DFS)
- Breadth First Search (BFS)
-
Dynamic Programming
- Knapsack
- Longest increasing Subsequence (with RMQ)
-
Bit Manipulation
-
Optional Advanced Algorithms
- AVL Trees
- Graph Coloring
- Topological Sorting
- Flood Fill - Graph