Competitive Programming
Competitive Programming
Mentors :
Virendra Kabra
Mentees :
6
The main goal is to get comfortable with commonly used algorithms and data structures for CP. Specifics of Week 5, 6, 7, 8 are subject to change. These weeks will coincide with vacations, and thus we will plan to take up working on the more complex features towards the end.
Resources:
Online resources include cp-algorithms,
CSES and GFG, among others.
Prerequisites : CS101
Tentative Timeline :
| Week | Work |
|---|---|
| Week 1 | C++ STL Basics |
| Week 2 | Sorting and Searching |
| Week 3 | Graph Algorithms |
| Week 4 | Divide-Conquer and Greedy Paradigms |
| Week 5 | Dynamic Programming |
| Week 6 | Range Queries |
| Week 7 | Flows |
| Week 8 | Problems |
