Freshers' CP Class 1 content added

Freshers/CompetitiveProgramming/2022_03_05_CPClass-1/README.md

@@ -0,0 +1,47 @@
+# CP Class 1
+
+[.. Previous Page](..)
+
+## Class recording: [Here](https://drive.google.com/file/d/1iL0431vaZTRBrhe9ToJqaKCWXtBOpgS3/view?usp=sharing)
+
+## PPT:
+- [Modular Arithmetic](Modular%20Arithmetic.pdf)
+- [Basic Hashing](Basic%20Hashing.pdf)
+
+March 05th, 2022
+
+<div align="center"><img src="../CP_logo.png" alt="CP logos" height=200/></div>
+
+<hr>
+
+## Tasks:
+
+- Go through above PPTs thoroughly and understand the concepts.
+- Read the proofs of Modular Arithmetics from GFG:
+    - [Modular Arithmetic](https://www.geeksforgeeks.org/modular-arithmetic/)
+    - [Modular Addition](https://www.geeksforgeeks.org/modular-addition/)
+    - [Modular Multiplication](https://www.geeksforgeeks.org/modular-multiplication/)
+    - [Modular Multiplicative Inverse](https://www.geeksforgeeks.org/multiplicative-inverse-under-modulo-m/)
+    - [Euclidean Algorithm](https://www.geeksforgeeks.org/euclidean-algorithms-basic-and-extended/)
+    - [Modular Division](https://www.geeksforgeeks.org/modular-division/)
+    - [Modular Exponentiation](https://www.geeksforgeeks.org/modular-exponentiation-power-in-modular-arithmetic/)
+
+- [HackerEarth Tutorial on Modular Arithmetic](https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-1/tutorial/)
+- Continue learning from [cp-algorithms.com](https://cp-algorithms.com/)
+
+## Tasks
+
+- [MARBELS](https://www.spoj.com/problems/MARBLES/)
+- [FLOW06](https://www.codechef.com/problems/FLOW016)
+- [Selection of 2 Cities](https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-1/practice-problems/algorithm/selection-of-cities-2/description/)
+- [Calculate The Power](https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-1/practice-problems/algorithm/calculate-the-power/description/)
+- [ZSUM](https://www.spoj.com/problems/ZSUM/)
+- [ENIGMATH](https://www.spoj.com/problems/ENIGMATH/)
+- [GCD2](https://www.spoj.com/problems/GCD2/)
+- [Max Occurrence](https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-tables/practice-problems/algorithm/maximum-occurrence-9/)
+- [Winner](https://codeforces.com/problemset/problem/2/A)
+- [Highest Rating](https://www.hackerearth.com/practice/data-structures/hash-tables/basics-of-hash-tables/practice-problems/algorithm/highest-rating-f8ead57a/)
+
+<hr>
+
+{% include disqus.html %}

Freshers/CompetitiveProgramming/README.md

@@ -0,0 +1,56 @@
+# Freshers' CP classes resources
+
+[.. Previous Page](..)
+
+<div align="center"><img src="CP_logo.png" height="200"/></div>
+
+## Classes held
+
+- [Class 1: held on January 22, 2022](2022_01_22_CClass-1)
+
+## Books
+- *(Not a book)*: [cp-algorithms.com](https://cp-algorithms.com/)
+- [HANDBOOK FOR ICPC by HALIM](https://drive.google.com/file/d/1--c6A6D3hB8QKShEdvAVnj0rkLC5wlt_/view?usp=sharing)
+- [CP HANBOOK by Laaksonen](https://cses.fi/book/book.pdf)
+- [STANFORD ICPC TEAM NOTEBOOK](https://cs.stanford.edu/group/acm/oldsite/SLPC/notebook.pdf)
+- [Introduction to Algorithms by Cormen](http://ressources.unisciel.fr/algoprog/s00aaroot/aa00module1/res/%5BCormen-AL2011%5DIntroduction_To_Algorithms-A3.pdf)
+
+## Online Judges
+
+- [CSES](https://cses.fi/)
+- [SPOJ](https://www.spoj.com/)
+- [HACKERRANK](https://www.hackerrank.com/)
+- [HACKEREARTH](https://www.hackerearth.com/)
+- [CODECHEF](https://www.codechef.com/)
+- [CODEFORCES](https://codeforces.com/)
+- [UVA](https://uva.onlinejudge.org/)
+- [TOPCODER](https://www.topcoder.com/)
+- [A2OJ](https://a2oj.com/)
+- [PROJECT EULER](https://projecteuler.net/)
+- [ICPC LIVE ARCHIVE](https://icpcarchive.ecs.baylor.edu/)
+- [TIMUS](http://acm.timus.ru/)
+- [KATTIS](https://open.kattis.com/)
+- [Atcoder](https://atcoder.jp/)
+
+## Some links for Competitive Programming Syllabus
+
+- [Get Started With The Sport Of Programming](https://www.codechef.com/guide-to-competitive-programming)
+- [All Algorithms](https://discuss.codechef.com/questions/48877/data-structures-and-algorithms)
+- [An awesome list for competitive programming!](https://codeforces.com/blog/entry/23054)
+- [ICPC Syllabus](https://docs.google.com/document/d/1_dc3Ifg7Gg1LxhiqMMmE9UbTsXpdRiYh4pKILYG2eA4/edit)
+- [Topics](https://discuss.codechef.com/questions/18752/what-are-the-must-known-algorithms-for-online-programming-contests)
+- [Algorithms](https://cp-algorithms.com/)
+
+## Coordinator contacts (click to chat)
+
+-   [Aditya Bansal](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Ankit Raj](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Nikhil Kumar Singh](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Ishu Raj](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Aakanksha Khetan](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Ashutosh Chitranshi](https://teams.microsoft.com/l/chat/0/[email protected])
+-   [Nishchal Siddharth Pandey](https://teams.microsoft.com/l/chat/0/[email protected])
+
+<hr>
+
+{% include disqus.html %}

Freshers/README.md

@@ -18,6 +18,8 @@
     - [C Class 8](C/2022_02_19_CClass-8)
     - [C Class 9](C/2022_02_20_CClass-9)
     - [C Class 10](C/2022_02_26_CClass-10)
+- [Competitive Programming](CompetitiveProgramming)
+    - [Class 1](CompetitiveProgramming/2022_03_05_CPClass-1): Time & Space complexity, Modular arithmetic, Hashing
 
 ## Get all class recordings:
 [Here](https://drive.google.com/drive/folders/1v2kw3r9IcaHw8eIsZJgJvS6TqFnLNaaH?usp=sharing)

README.md

@@ -69,6 +69,8 @@ If you are a part of MNNIT join us on Microsoft Team [MNNIT CC Queries Official]
         - [C Class-8](Freshers/C/2022_02_19_CClass-8)
         - [C Class-9](Freshers/C/2022_02_20_CClass-9)
         - [C Class-10](Freshers/C/2022_02_26_CClass-10)
+    - [Competitive Programming](Freshers/CompetitiveProgramming)
+        - [Class-1](Freshers/CompetitiveProgramming/2022_03_05_CPClass-1)
 
 - [Git/GitHub classes](Git-GitHub)
     - [Git Class-1](Git-GitHub/2021_04_20_GitClass-1)