Level 2 Training at Coademy with Coach Hossam is an advanced 7-week program tailored for those who have mastered the fundamentals and are ready to tackle complex programming concepts. With two training days per week and two sessions per day (each session lasting 3 hours), this course blends focused practice and in-depth exploration of new topics to elevate your programming skills to the next level.
📚 What You’ll Learn:
You'll dive deep into critical concepts essential for high-level programming and competitive programming:
- Binary Search & Complete Search: Learn efficient search techniques, both iterative and recursive.
- Greedy Algorithms: Understand how to make optimal decisions within constraints.
- Prime Numbers, GCD & LCM, Euler’s Totient (Phi), Modulo Arithmetic: Master mathematical tools crucial for algorithm design.
- Dynamic Programming: Discover powerful techniques to solve problems by breaking them into simpler subproblems.
- Graph Theory: Explore Graph Data Structures, DFS, BFS, Union-Find, MST, and shortest-path algorithms (Dijkstra, Bellman-Ford, Warshall).
- Segment Trees: Handle range queries efficiently with advanced data structures.
đź’Ş Why Choose This Course?
- Expert Guidance: Learn from Coach Hossam, who has guided countless students to excel in programming competitions and land top software jobs.
- Structured Learning: Each training day is split into practice and learning new topics, ensuring thorough understanding before moving forward.
- Comprehensive Curriculum: The advanced concepts covered in this level are essential for anyone looking to excel in programming competitions or high-level software engineering.
- Final Contest: Test your skills in a challenging contest to reinforce everything you've learned.
📆 Course Schedule:
- Duration: 7 Weeks (Repeats every 7 weeks)
- Training Days per Week: 2
- Sessions per Day: 2 (3 hours each)
đź“ť Complete Course Outline:
| Day | Date | Session 1 | Session 2 |
|---|
| 1 | TBD | - | Binary Search |
| 2 | TBD
| General Practice
| Complete Search (Iterative) + Greedy |
| 3 | TBD
| General Practice | Prime Numbers, GCD & LCM, Euler’s Totient (Phi) & Modulo Arithmetic |
| 4 | TBD
| General Practice | Complete Search (Recursive) |
| 5 | TBD
| General Practice
| Complete Search (Recursive) |
| 6 | TBD
| General Practice
| Dynamic Programming |
| 7 | TBD
| General Practice
| Dynamic Programming |
| 8 | TBD | General Practice
| Graph DSs & DFS |
| 9 | TBD
| DFS Applications | Union-Find Disjoint Sets & MST |
| 10 | TBD
| General Practice
| BFS & Dijkstra |
| 11 | TBD
| General Practice
| Bellman & Warshal |
| 12 | TBD
| General Practice
| Segment Tree |
| 13 | TBD
| General Practice
| Segment Tree |
14 | TBD
| Level 2 Contest |