Added CP Class 3 and 4 content

Freshers/CompetitiveProgramming/2022_03_12_CPClass-3/README.md

@@ -0,0 +1,27 @@
+# CP Class 3
+
+[.. Previous Page](..)
+
+## Class recording: [Here](https://drive.google.com/file/d/1Azd7bniTZgENavj4h0hxmRUaoLsAs02Y/view?usp=sharing)
+
+## PPT: [Binary Search](Binary%20Search.pdf)
+
+March 12th, 2022
+
+<div align="center"><img src="../CP_logo.png" alt="CP logos" height=200/></div>
+
+<hr>
+
+## Tutorials
+
+- [Linear Search](https://www.hackerearth.com/practice/algorithms/searching/linear-search/tutorial/)
+- [Basic Binary Search](https://www.hackerearth.com/practice/algorithms/searching/binary-search/tutorial/)
+
+## Tasks
+
+- _First complete [last class tasks](../2022_03_06_CPClass-2/)._
+- _Find Binary Search Questions in the [next class content](../2022_03_13_CPClass-4/)._
+
+<hr>
+
+{% include disqus.html %}

Freshers/CompetitiveProgramming/2022_03_13_CPClass-4/README.md

@@ -0,0 +1,28 @@
+# CP Class 4
+
+[.. Previous Page](..)
+
+## Class recording: [Here](https://drive.google.com/file/d/1apg5Gj4Rkd6fOmXBuJIyxK66CdsAG7XI/view?usp=sharing)
+
+## PPT: [Binary Search](Advanced%20Binary%20Search.pdf)
+
+March 13th, 2022
+
+<div align="center"><img src="../CP_logo.png" alt="CP logos" height=200/></div>
+
+<hr>
+
+## Tasks
+
+- [Remaining chocolates](https://www.hackerrank.com/contests/mnnit2018opc1/challenges/remaining-chocolates/problem)
+- [SPOJ AGGRESIVE COWS](https://www.spoj.com/problems/AGGRCOW/)
+- [SPOJ: EKO](https://www.spoj.com/problems/EKO/)
+- [SPOJ: BOOKS1](https://www.spoj.com/problems/BOOKS1/)
+- [OPCPIZZA](https://www.spoj.com/problems/OPCPIZZA/)
+- [SPOJ: PIE](https://www.spoj.com/problems/PIE/)
+- [CODEFORCES: 812C](https://codeforces.com/problemset/problem/812/C)
+- [Ada and Chocolate](https://www.hackerrank.com/contests/pir2k21-1/challenges/ada-and-chocolate/problem)
+
+<hr>
+
+{% include disqus.html %}

Freshers/CompetitiveProgramming/README.md

@@ -8,9 +8,12 @@
 
 - [Class 1: held on March 05, 2022](2022_03_05_CPClass-1)
 - [Class 2: held on March 06, 2022](2022_03_06_CPClass-2)
+- [Class 3: held on March 12, 2022](2022_03_12_CPClass-3)
+- [Class 4: held on March 13, 2022](2022_03_13_CPClass-4)
 
 ## Books
-- *(Not a book)*: [cp-algorithms.com](https://cp-algorithms.com/)
+
+- _(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)
@@ -44,13 +47,13 @@
 
 ## 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])
+- [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>
 

Freshers/README.md

@@ -21,6 +21,9 @@
 - [Competitive Programming](CompetitiveProgramming)
     - [Class 1](CompetitiveProgramming/2022_03_05_CPClass-1): Time & Space complexity, Modular arithmetic, Hashing
     - [Class 2](CompetitiveProgramming/2022_03_12_CPClass-2): Sieve of Eratosthenes, Sieve of Eratosthenes (Segmented), Smallest Prime Factor, GCD, Binary Exponentiation.
+    - [Class 3](CompetitiveProgramming/2022_03_12_CPClass-3): Binary Search
+    - [Class 4](CompetitiveProgramming/2022_03_13_CPClass-4): Advanced Binary Search
 
 ## Get all class recordings:
+
 [Here](https://drive.google.com/drive/folders/1v2kw3r9IcaHw8eIsZJgJvS6TqFnLNaaH?usp=sharing)

README.md

@@ -72,6 +72,8 @@ If you are a part of MNNIT join us on Microsoft Team [MNNIT CC Queries Official]
     - [Competitive Programming](Freshers/CompetitiveProgramming)
         - [Class-1](Freshers/CompetitiveProgramming/2022_03_05_CPClass-1)
         - [Class-2](Freshers/CompetitiveProgramming/2022_03_06_CPClass-2)
+        - [Class-3](Freshers/CompetitiveProgramming/2022_03_12_CPClass-3)
+        - [Class-4](Freshers/CompetitiveProgramming/2022_03_13_CPClass-4)
 
 - [Git/GitHub classes](Git-GitHub)
     - [Git Class-1](Git-GitHub/2021_04_20_GitClass-1)