RESOURCES ALGORITHM – WEEK 1
WEEK 1 STUDY PLAN:
1) LANGUAGE
2) C++ STL
3) BASIC MATH
4) COMBINATORICS AND PROBABILTY
LANGUAGE :
We do not have any preference over a language but we suggest you to
choose C++ as it is used by most of the competitive programmers and it
has a very vast Standard Template Library ( STL ) That reduce the work
many folds.
If you have already learnt basic C programming in first semester then,
you can follow this lecture to start with C++:
C++ Basics in One Shot - Strivers A2Z DSA Course - L1
Else to learn C++ from scratch :
C++ Tutorial for Beginners - Full Course
Before Moving to next topics, you may practice some questions on
Solve C++ | HackerRank to get hands on C++.
Feel free to try some medium level problems as well.
C++ STL
You can refer for beginner level STL:
https://www.codechef.com/LEARNDSA
And see the corresponding video:
https://www.youtube.com/playlist?list=PLQXZIFwMtjow
NK0L1hVSCdzWgO%20oYr42--
Watch the playlist:
https://www.youtube.com/watch?v=LyGlTmaWEPs&list=PL
k6CEY9XxSIA-xo3HRYC3M0Aitzdut7AA
For Quick revision:
https://www.youtube.com/watch?v=RRVYpIET_RU
BASIC MATH :
Here some of links have problems below them, do try .
Basic Concepts :
1) Modulo arithmetic : Modulo - Wikipedia
2) Binary exponentiation : Binary Exponentiation. Topic
Difficulty: EASY Pre Requisites… | by Ashwanth K | Spider
R&D | Medium
3) Euclidean algorithm : Basic Maths for DSA | Euclidean
Algorithm | Strivers A2Z DSA Course
4) Seive of Eratosthenes : Sieve of Eratosthenes |
GeeksforGeeks
Advanced Concept :
1) Matrix Exponentiation : Matrix Exponentiation. A nice
technique, which you will… | by Ashwanth K | Spider R&D |
Medium
Read the following articles from algebra section cp-algorithm :
Main Page - Algorithms for Competitive Programming
- Extended Euclidean Algorithm
- Linear Diophantine Equations
- Fibonacci Numbers
- Euler's totient function
- Number of divisors / sum of divisors
- Modular Inverse
- Linear Congruence Equation
- Chinese Remainder Theorem
- Factorial modulo
You can practice questions from Introductory Algorithms and
Mathematics section of CSES problem set :
CSES - CSES Problem Set - Tasks
Also you can filter Basic Maths and Number Theory questions
on Codeforces.
COMBINATORICS AND PROBABILTY:
1)Read
https://www.topcoder.com/thrive/articles/Basics%20of%20Co
mbinatorics
2)Read all articles from Combinatorics section cp-algorithm:
http://cp-algorithms.com/
3) https://www.youtube.com/watch?v=le2enQgQ7Ws
4)Expected values :
https://codeforces.com/blog/entry/62690
https://codeforces.com/blog/entry/62792
-------------------------------------------------------------------------------------------------
BASIC GUIDELINES:
1. Make account on all CP platforms like Codeforces, Codechef, Atcoder.
2. Give contests regularly on these platforms.
3. You can use Codeclock app to check the date and time of all these
contests across different platforms in a single app.
4. For rating improvement
• Practice questions that are rated +200 from your current rating.
• Try to up solve 1-2 questions that u couldn’t solve during the
contest.
5. The last and the most important
--- NEVER EVER USE AI IN THE CONTEST---
