BIG-O CODING COMPETITIVE PROGRAMMING · A 4-LEVEL PATH FOR STUDENTS

Competitive Programming: prep for Young Informatics, Chuyên Tin entrance, Olympiads and ACM-ICPC

4 levels, each with 16 live online sessions with instructors. Take an entrance test to be placed at the right level; you don't have to start from the first level.

Placement round🔥 Entrance tests open

Competitive Programming · New classes start every month

2 sessions/week · Online live class (taught in Vietnamese)

1,690,000 VND/monthFull 4-level path over 12 months, or 18,600,000 VND paid in full (instead of 31,000,000 VND)

✓ Placement by ability✓ Flexible monthly tuition

Students and instructors in a Big-O Coding class
⭐ 5.0 / 400+ Google reviews

Competitive Programming tuition, schedule and duration

Ideal forSchool and university students who love programming and want to take the Young Informatics Contest, get into a specialized IT class (Chuyên Tin), or compete in the National Excellent Student Contest, the Informatics Olympiad or ACM-ICPC
Who it's forSchool students / first-year university students
Duration4 levels · 16 sessions/level
GoalsYoung Informatics / Olympiad / ACM-ICPC
FormatOnline live class (taught in Vietnamese)
ScheduleNew classes start every month, 2 sessions a week
PlacementTake an entrance test to be placed at the right level; you don't have to start from the first level
TuitionPer level: Green Plus 6,500,000 VND, Blue Plus 7,500,000 VND, Orange Plus 8,500,000 VND, Elite Team 8,500,000 VND. Full 4-level path: 18,600,000 VND (instead of 31,000,000 VND) or 1,690,000 VND a month for 12 months
Student results2000+ students trained, 5.0 rating from 400+ Google reviews (reviews)

✨ Who the Competitive Programming track is for

  • ✓Have strong logical thinking and love programming and solving problems.
  • ✓Want to take on the Young Informatics Contest, the specialized IT high school (Chuyên Tin) entrance exam, the National Excellent Student Contest, the Informatics Olympiad or ACM-ICPC.
  • ✓Need a structured path from the foundations all the way to national and international programming contests.
  • ✓Want not just to know how to code, but how to analyze a problem and choose the right algorithm.
  • ✓Want to get used to mini contests, skill scorecards and time pressure.
  • ✓Are university students who want to build an algorithm foundation for programming contests.

🧭 How are school and university students placed?

Before joining the program, students take an entrance test so Big-O can place them at the right level. Students don't have to start from the first level if they already have a suitable foundation.

Register for placement
Competitive Programming path offer

40% off the 4-course combo

Parents can pay for the full path to keep the offer, or pay separately for each course: Green Plus, Blue Plus, Orange Plus and Elite Team.

Save up to 12,400,000 VND
Getting Started - Green Plus6,500,000 VND
Algorithm Foundations - Blue Plus7,500,000 VND
Advanced Competition - Orange Plus8,500,000 VND
Elite Team8,500,000 VND
Total if paid separately31,000,000 VND
Best combo
31,000,000 VND
18,600,000 VND
The full 4-level path: Green Plus → Blue Plus → Orange Plus → Elite Team.
Pay in full Best deal - save 12,400,000 VND
Flexible 12-month plan 1,690,000 VND / month Total 20,280,000 VND, still 10,720,000 VND less than taking the courses separately.
Paying in full saves an extra 1,680,000 VND compared with the monthly plan.
Sign up for tuition advice

4-LEVEL PATH

Level 1: Programming Foundations, Level 2: Algorithm Foundations. Level 3: Advanced Competition. Level 4: Elite Team.

01 Green Plus

Getting Started

For students who are just starting out, or who know a little but don't have solid foundations yet.

  • Green Plus advanced problems made specially for specialized high school entrance exams
  • Logical thinking, simulation, reading problem statements
  • End-of-course mini contest
  • Skill assessment to qualify for Level 02
See the Green base course
02 Blue Plus

Algorithm Foundations

For students who already know variables, loops, arrays and functions and want to learn algorithms the right way.

  • Competitive Programming problems for every topic
  • Optimizing algorithms, not just writing correct code
  • Young Informatics and school-team style problems
  • Mini contests and skill scorecards
See the Blue base course
03 Orange Plus

Advanced Competition

For students who already have an algorithm foundation and want to prepare for specialized IT high school (Chuyên Tin) entrance, Excellent Student Contests and entry-level Olympiads.

  • Orange Plus advanced problems for competitions
  • Focus on contest problems and problem-solving strategy
  • Practice analyzing problems and choosing an approach
  • Assessment to qualify for the Elite Team class
See the Orange base course
04 Gold

Elite Team

For students with strong foundations who have completed the earlier levels or passed the entrance test.

  • Advanced Graph, Range Query, DP, String, Math, Geometry and Flow
  • Regular contests, upsolving, fixing reasoning mistakes and optimizing solutions
  • Personal guidance for Young Informatics, specialized IT high school (Chuyên Tin) entrance, Excellent Student Contests, Olympiad, ACM-ICPC
See the Elite Team syllabus

📅 Competitive Programming start dates

Competitive Programming - Next placement round New classes start every month · 2 sessions/week 🔥 Entrance tests open
Elite Team Admission via Orange Plus or an entrance test ✅ Waitlist open

What Competitive Programming students say

““WHAT CAN SOMEONE WHO COULDN'T EVEN PASS THE HIGH SCHOOL ENTRANCE EXAM POSSIBLY DO?” That was the reason I didn't have to try anymore, all through my 3 years of high school.”
Bùi Đức ToànCP01 student
“I was a student in the very first CP course. Having completed all 4 levels (1-4), I'd say the course is quite hard, but in return, if you put in the effort, you'll see clear progress after the first course, and the teacher and the TAs are also very enthusiastic.”
Nam HoàngCP01 student

Read more student reviews →

Register for Competitive Programming placement

Big-O Coding will contact you via Zalo or phone within 30 minutes to advise on placement

More options: package, referrer, notes
Single course Pay per course after placement From 6,500,000 VND 40% off 4-course combo Green Plus + Blue Plus + Orange Plus + Elite Team 18,600,000 VND
❌ Something went wrong. Please call us directly at 0937 401 483

No need to pick the exact level now · Big-O will run an entrance test and recommend the right path

✅

You're registered!

Big-O Coding has received your details.

We will contact you by Zalo or phone within the next 30 minutes.

📞 Phone: 0937 401 483

💬 Email: admin@bigocoding.com

DETAILED SYLLABUS - ELITE TEAM

The Elite Team course offers high-difficulty problems designed specifically for specialized IT high school (Chuyên Tin) entrance, the National Excellent Student Contest, Olympiads and ACM-ICPC.

Click to see the 16-session syllabus
PART 1 - CONTEST STRATEGY & ADVANCED GRAPHS
Session 01 - Contest Strategy & Diagnostic Test

Content: Take an entrance test, read the whole problem set, sort problems by difficulty, choose a solving order and manage time during a contest.

Outcome: Students understand their current strengths/weaknesses and learn how to avoid getting bogged down in the exam room.

Session 02 - MST: Prim, Kruskal & Advanced DSU

Content: Minimum spanning trees, Prim, Kruskal, DSU optimized with Path Compression and Union by Rank.

Hands-on: Recognize problems about minimum connections, road networks, construction costs and grouping components.

📖 Read ahead: Minimum spanning trees: understanding and choosing between Kruskal and Prim

Session 03 - Bridge, Articulation Point & SCC / Tarjan

Content: Low-link, bridges, articulation points, strongly connected components and Tarjan's algorithm.

Outcome: Students learn to analyze the weak points of a network and split a graph into structured blocks.

📖 Read ahead: Articulation points and bridges in graphs: understanding tin and low through DFS · Strongly connected components: Kosaraju and the idea behind Tarjan

Session 04 - Bellman-Ford, Floyd-Warshall & Shortest Path Variants

Content: Shortest paths with negative edges, negative cycle detection, Floyd-Warshall and variants of BFS/Dijkstra.

Hands-on: Read the constraints to choose the right shortest-path algorithm instead of applying one mechanically.

📖 Read ahead: 0–1 BFS: finding shortest paths with a deque · Bellman–Ford: shortest paths with negative edges and negative cycles · Floyd–Warshall: shortest paths between all pairs of vertices

PART 2 - TREE, RANGE QUERY & MIDTERM
Session 05 - Fenwick Tree + Sparse Table / RMQ

Content: Fenwick Tree for dynamic queries, Sparse Table for static queries, and the Range Minimum Query problem.

Outcome: Students learn to choose a data structure based on the problem's update/query pattern.

📖 Read ahead: Fenwick Tree: lowbit, point updates and range sums · Sparse Table: static range minimum queries with two blocks

Session 06 - LCA & Tree Query

Content: Lowest Common Ancestor, Binary Lifting, distances on trees and ancestor queries.

Hands-on: Turn tree problems into fast queries instead of traversing from scratch each time.

📖 Read ahead: LCA: lowest common ancestor with binary lifting

Session 07 - Advanced Segment Tree + Lazy Propagation

Content: Segment Tree for range queries and range updates, Lazy Propagation and common variants.

Outcome: Handle large, frequently changing data without getting Time Limit Exceeded.

📖 Read ahead: Lazy propagation: range additions and sum queries with a Segment Tree

Session 08 - Midterm Contest

Activities: A mid-course contest covering advanced Graphs, MST, Tarjan, Shortest Path, Fenwick, RMQ, LCA and Segment Tree.

Review: Go over the problems, fixing reasoning errors, algorithm-choice errors and implementation errors.

PART 3 - STRING, MATH & DYNAMIC PROGRAMMING
Session 09 - KMP, Z-function, Trie & Rolling Hash

Content: Key string algorithms for contests: pattern search, prefixes, dictionaries, string hashing.

Hands-on: Handle pattern matching, prefix/suffix tasks, duplicate-string checks and fast string queries.

Session 10 - Modular Inverse & Combinatorics

Content: Modular inverses, Fermat's little theorem, combinations, permutations and precomputing modular factorials.

Outcome: Solve counting problems with a large modulus without overflow or wrong divisions.

Session 11 - Inclusion-Exclusion, Catalan & Probability

Content: Inclusion-exclusion, Catalan numbers and basic probability in contest problems.

Hands-on: Recognize problems on counting without duplicates, valid bracket structures, valid paths and discrete probability.

Session 12 - DP Bitmask + DP on Tree

Content: Subset states, selection/pairing problems, dynamic programming on trees and merging results from children up to parents.

Outcome: Students learn to design DP states when the input has small sets or a tree structure.

📖 Read ahead: Bitmask DP: remembering the chosen set through the traveling salesman problem · DP on trees: choosing non-adjacent vertices and merging branches to find the diameter

Session 13 - Digit DP + Edit Distance

Content: DP over digits, upper/lower bound constraints and the string edit distance problem.

Hands-on: Count numbers that meet a condition within a large range and handle string transformations with dynamic programming.

📖 Read ahead: Digit DP: counting numbers digit by digit and keeping the tight bound · Edit Distance: the fewest character insertions, deletions and substitutions

PART 4 - GEOMETRY, FLOW & FINAL CONTEST
Session 14 - Basic Geometry + Convex Hull

Content: Points, vectors, orientation, segment intersection, distances and the Convex Hull.

Outcome: Students gain enough geometry grounding to handle the geometry problems common in team-selection contests.

Session 15 - Max Flow / Bipartite Matching

Content: Flow models, Dinic, bipartite matching and how to turn real-world problems into flow/matching problems.

Going further: Min-cost max-flow, HLD, Suffix Array and DP Optimization are introduced as advanced topics to study after the course.

Session 16 - Final Contest + Personal Roadmap Review

Activities: An end-of-course contest that simulates real exam pressure, followed by upsolving and a review of contest strategy.

Takeaway: Each student receives a personal assessment: strong topics, weak topics, problems to keep practicing and guidance toward Young Informatics, specialized IT high school (Chuyên Tin) entrance, Excellent Student Contests, Olympiad or ACM-ICPC.

🎁 What makes the Competitive Programming track different

Dedicated advanced problem sets

Basic problems, standard course problems, Competitive Programming problems and challenge problems.

Regular mini contests

Practice reading problems, managing time and handling pressure during a contest.

Assessment after every level

Identify strong topics, weak topics and readiness for the next level.

A long-term path

Go from programming foundations to algorithmic thinking and serious competition.

Read ahead on our blog

See the Programming Handbook →

Frequently asked questions about Competitive Programming

What does the Competitive Programming track cover?

A 4-level path: Green Plus (programming foundations), Blue Plus (algorithm foundations), Orange Plus (advanced competition) and Elite Team. The 16-session Elite Team syllabus covers contest strategy and advanced graphs, trees and range queries, strings, math and dynamic programming, geometry and flows, with a midterm contest and a final contest.

How do the online classes work?

You learn live online with the instructor (online live class, taught in Vietnamese), 2 sessions a week. New classes start every month.

How does tuition work?

Per level: Green Plus 6,500,000 VND, Blue Plus 7,500,000 VND, Orange Plus 8,500,000 VND, Elite Team 8,500,000 VND. Full 4-level path: 18,600,000 VND (instead of 31,000,000 VND) or 1,690,000 VND a month for 12 months.

Which level will the student be placed in?

Students take an entrance test so Big-O can place them at the right level. They don't have to start from the first level if they already have a suitable foundation.

Ready to find the right level for the student?

Register for Placement via Zalo