| Quick Access | Description |
|---|---|
| C++ template | Our competitive programming template suggestion |
| CPCFI's Syllabus | Check out the topics per unit we cover throughout a year |
| Unit 1 | Introduction to Competitive Programming |
| Unit 2 | Non-Linear Data Structures |
| Unit 3 | Complete Search, Divide & Conquer, Greedy |
| Unit 4 | Dynamic Programming I |
| Unit 5 | Dynamic Programming II |
| Unit 6 | Graphs I |
| Unit 7 | Graphs II |
| Unit 8 | Mathematics |
| Unit 9 | Strings Processing and Computational Geometry |
| Unit 10 | Advanced Topics |
Note for CPCFI's professors: please read NewLectures.md file before adding or modifying any lecture's topic organization.