Competitive Programming
Tuyển Học Sinh Giỏi Tin học — the Vietnamese high-school competitive-programming path. Learn to read a contest problem, choose an algorithm that fits the constraints, implement it fast in C++, and defend it against edge cases — from school selection rounds toward provincial HSG.
Competitive Programming — High School Beginner
The Vietnamese Học sinh giỏi preparation path: reading statements, complexity, marking arrays, sorting and binary search, prefix and difference arrays, strings, number theory, STL, recursion and backtracking, basic DP, graphs, and four mock contests. Every problem is graded for real in the C++20 sandbox.
Competitive Programming — High School Intermediate
The provincial-HSG level of the Vietnamese competitive-programming path: complexity budgets, binary search, interval sweeps, exchange-argument greedy, Fenwick and segment trees, DSU/MST, Dijkstra, DAG counting, tree algorithms, sequence/knapsack/bitmask DP, number theory, hashing and KMP, synthesis, debugging, and three mock contests — all graded in the C++20 sandbox.
Competitive Programming — High School Advanced
The top level of the Vietnamese competitive-programming path, toward national and olympiad-style problems: lazy trees, binary lifting, tree DP, HLD, SCC, flow and matching, digit/interval/suffix DP, number theory, combinatorics, geometry, synthesis, debugging, and mock contests — all graded in the C++20 sandbox.
Competitive Programming — High School Mastery
The problem-solving capstone of the Vietnamese HSG path: not more algorithms, but the working method — reading constraints, discovering the key observation, synthesizing techniques, proving correctness, optimizing, debugging plausible-but-wrong code, building counterexamples, stress testing, and harvesting partial scores — drilled through 14 process-first modules and graded in the C++20 sandbox.
Competitive Programming — High School Intensive
The mastery stage of the Vietnamese competitive-programming path: problem recognition without labels, constraint budgeting, key observations, algorithm combinations, optimization and wrong-solution clinics, stress testing, subtask strategy, timed and mixed sets, mock contests, and editorial study with re-solve and variation transfer — all graded in the C++20 sandbox.