Our program is structured around two comprehensive levels, each lasting 7 weeks. You can choose to join Level 1, Level 2, or both, depending on your current skill level and learning goals.Training Format:
Ideal for those building a strong programming base. This level covers essential topics to prepare you for more advanced concepts.
Day | Session 1 | Session 2 |
|---|---|---|
1 | - | Intro & Conditions |
2 | Practice Conditions | Loops |
3 | Practice Loops | Nested Loops |
4 | Nested Loops | Arrays |
5 | Practice Arrays | 2D Arrays |
6 | Practice 2D Arrays | Complexity Analysis |
7 | General Practice | Functions |
8 | General Practice | Built-in Functions |
9 | General Practice | STLs 1 |
10 | General Practice | STLs 2 |
11 | General Practice | General Revision on Level 1 |
12 | General Practice | General Revision on Level 2 |
13 | General Practice | General Revision on Level 3 |
14 | Level 1 Contest | |
Key Takeaways:
Perfect for those ready to tackle more complex topics and improve their competitive programming skills.
| Day | Session 1 | Session 2 |
|---|---|---|
| 1 | - | Binary Search |
| 2 | Binary Search | Complete Search (Iterative) & Greedy |
| 3 | General Practice | Prime Numbers, GCD & LCM, Euler’s Totient (Phi), Modulo Arithmetic |
| 4 | General Practice | Complete Search (Recursive) |
| 5 | General Practice | Complete Search (Recursive) |
| 6 | General Practice | Dynamic Programming |
| 7 | General Practice | Dynamic Programming |
| 8 | General Practice | Graph Data Structures & DFS |
| 9 | DFS Applications | Union-Find Disjoint Sets & MST |
| 10 | General Practice | BFS & Dijkstra |
| 11 | General Practice | Bellman & Warshall |
| 12 | General Practice | Segment Tree |
| 13 | General Practice | Segment Tree |
| 14 | Level 2 Contest | |
Key Takeaways:
Don't miss out on this opportunity to enhance your programming skills! Join the next batch and start your journey towards becoming a programming expert.