Practice algorithm selection, implementation speed, and accuracy under contest-style pressure.
Subscribe Now!
Subscribe Now! and Know every thing new about our new waves / rounds and offers.
Specialization over generalization
University Competitive Programming
Master the art of problem-solving with a structured, in-depth curriculum covering C++, Data Structures, Algorithms, and Competitive Programming. Learn the essential techniques to optimize code efficiency, ace coding interviews, and excel in programming contests.
Then join Senior Training for free with Coach Mohamed Abdelwahab.
Program Outcome
Train for ACPC, ICPC-style contests, and technical interviews.
The program moves students from C++ foundations into advanced data structures, algorithms, graph theory, dynamic programming, and high-level competitive programming.
Build the data structures and algorithms foundation needed for technical interview rounds.
Move through five connected levels, from beginner C++ to advanced graph and string algorithms.
What is University Competitive Programming?
A comprehensive program for university students who want to build deep algorithmic problem-solving ability and compete with confidence. The curriculum combines live lectures, practice sessions, mentoring, sheets up-solving, and a clear progression through 4 training levels plus Senior Training.
Optimize code efficiency
Ace coding interviews
Excel in programming contests
Prepare for ACPC and ICPC-style training
Levels & Pricing
Choose a level, then compare Standard and Premium.
Each level shows its learning content and the matching prices for both available plans.
Programming In C++
Designed for beginners with no prior programming experience. Covers loops, conditions, arrays, strings, recursion, and STL.
Data Structures & Algorithms
Students dive into efficient problem-solving using recursion, backtracking, binary search, sorting techniques, bit manipulations, and advanced STL operations.
Competitive Programming I
Introduces greedy algorithms, number theory, DFS, BFS, shortest paths, Minimum Spanning Trees, and Disjoint Set Union.
Competitive Programming II
Goes deeper into dynamic programming, matrix exponentiation, segment trees, Lowest Common Ancestor, and binary indexed trees.
Competitive Programming III
Focuses on advanced algorithms including Trie, Rabin-Karp, KMP, suffix arrays, MO's algorithm, probability in DP, SCC, 2-SAT, articulation points, and bridges.
01Introduction, Conditions and Implementation Problems
02Loops and Simulation
03Arrays, Frequency Array and Prefix Sum
04Strings and Parsing
05STL I: Sequential Containers
06Sorting and Complexity Analysis
07Basic Greedy and Constructive Analysis
08Basic Mathematics and Coordinate Geometry
01STLs I: Linear Containers and Adapters
02STLs II: Ordered and Unordered Associative Containers
03Static Range Queries: Frequency Array and Prefix Sum
04Two Pointers and Sliding Window
05Binary Search and Binary Search on Answer
06Recursion, Backtracking and Brute-force Pruning
07Bit Manipulation and Subset Enumeration
08Number Theory I: Modular Arithmetic and Prime Factorization
09Number Theory II: Binary Power, Modular Inverse and GCD/LCM
10Basic Counting Principles
11Introduction to Graphs
01Introduction to Graphs I: Representation and DFS
02Introduction to Graphs II: BFS, SSSP and Multi-source BFS
03Dijkstra and 0-1 BFS
04Classical DP I
05Classical DP II
06Sparse Table
07Segment Tree: Point Update and Range Query
08Lazy Segment Tree and Merge Sort Tree
09Trie, Prefix Tree and Binary Trie
10String Hashing
11DSU with Rollbacks and MST
12Lowest Common Ancestor
13DP with Masks and Digit DP
01KMP and DP with KMP
02Aho-Corasick
03Suffix Array
04APSP: Floyd-Warshall and Bellman-Ford
05Euler Walk of Tree and Mo on Trees
06Small to Large Merging and DSU on Trees
07Heavy Light Decomposition
08Geometry
09Fast Fourier Transform
10Iterative DP and DP with DS
11Non-Classical DP
12Matrix Power
131D Fenwick Tree and Lower Bound
142D Fenwick Tree and Offline Version
15Sqrt-Decomposition and MO's Algorithm
16Persistent Segment Trees
01Trie and Advanced String Structures
02Rabin-Karp and String Matching
03KMP Deep Practice
04Suffix Arrays
05MO's Algorithm
06Probability in Dynamic Programming
07Strongly Connected Components
082-SAT
09Articulation Points
10Bridge-Finding Algorithms
Popular
Standard Plan
- 2 sessions per week: lecture and monitoring
- Fixed sessions timing
- 3 hours per session
Level 1
2000 EGP
Buy Now
Premium Plan
- Small size per group
- 2 sessions per week: lecture and monitoring
- Extra optional support session for Q & A
- Flexible intakes schedule
- 3 hours per session
Level 1
4000 EGP
Buy Now
After completing the levels
Students can join Senior Training for free with Coach Mohamed Abdelwahab to continue sharpening their competitive programming performance.
Why Coach Academy?
A serious training path with live guidance.
The journey is structured so every stage builds on the one before it.
Students learn through live discussion, practice, mentoring, and feedback.
The program develops critical thinking, teamwork, problem solving, and contest discipline.
FAQ
Program questions
Who is this program for?
University students who want to prepare for ACPC, ICPC-style contests, advanced problem solving, and technical interviews.
How long is the program?
The program includes 4 training levels plus Senior Training with an estimated total of 270 hours.
What happens after the training levels?
Students can join Senior Training for free with Coach Mohamed Abdelwahab.
How are the sessions structured?
Plans include 2 interactive sessions per week, usually combining lecture and practice or mentoring, with each session lasting 2 hours.
Contact Us
Need help choosing the right level?
Talk to the Coach Academy team and we will help you choose the best starting point.
Ready to train for competitive programming?
Start with the right level, build a strong problem-solving base, and move toward ACPC, ICPC-style contests, and interview-ready algorithmic thinking.
