Duration: 20 days of consistent learning & practice
Target: Be ready to solve Codeforces Div2 A and B problems!
- Introduction to Programming
- Data Types & Arithmetic & Bitwise Operations
- Conditions & Logical Operations
- Loops
- Arrays and Strings
- Functions & Built-In Functions
- Recursion
- Complexity Analysis
- Constructive Algorithms + Greedy
- STLs I: Vector, Pairs, Deque, Queue, Stack
- STLs II: Set, Map, Priority Queue
- For Coaches: Cover each topic over a week with 1 session for teaching + 1 session for solving problems.
- For Trainees: Aim to master each topic within 3-5 days by learning and completing problem sheets.
- Main Practice Sheet: Rokba's Park Vjudge Sheets
- Extra Problems: Additional Practice Sheet
| Topic | Videos | Blogs | Templates |
|---|---|---|---|
| Intro to Programming | Errichto on YouTube | Intro to Competitive Programming | |
| Data Types | Data Types Explained | Data Types Overview | |
| Conditions | Conditional Statements | If Conditions (W3Schools) | |
| Arrays | Working with Arrays | Intro to Arrays (W3Schools) | |
| Strings | Strings in C++ | Intro to Strings (W3Schools) | |
| Functions | Introduction to Functions | Functions (W3Schools) | |
| Recursion | Understanding Recursion | Recursion Overview (W3Schools) | |
| Complexity Analysis | Time Complexity & Big O | Time Complexity (USACO Guide) | |
| STLs | STLs in Arabic English STL Series | Intro to Data Structures (USACO Guide) Sets & Maps |
- For AtCoder and Codeforces problems, use tutorials and view others' accepted submissions.
- For UVA problems, feel free to Google for community solutions and discussions!
Let’s get started on this Level 0 journey and work toward solving Codeforces Div2 A and B problems confidently! Happy coding 🎉