You're Already Distinguished at the Gold Level. Take the Challenge and Finish the Race!

Gold level, in a sense, is the final stage of the USACO contests. Once a student advances from Gold to Platinum, the value of participation in the USACO contests increases dramatically. Needless to say, the difficulty level also rises accordingly.

Our Gold training program is designed to give you a thorough understanding of the algorithms tested at the Gold level centered around Graph Theory and Dynamic Programming. It includes two foundational classes and series of problem-solving classes. The foundational classes cover core topics to equip students with a solid theoretical framework. The problem-solving classes focus on applying these concepts and building skills in selecting and implementing the right algorithms to solve complex problems.

During each session, students engage in lectures covering new topics, followed by solving past USACO problems or specially designed exercises. Homework assignments involve implementing solutions to further reinforce learning, with automatic code evaluation and feedback provided through the Star League Online Portal (SLOnline).

Successful completion of the Gold Training Program exceeds the curricular requirements to pass the Gold contest. The Foundations modules can be taken in any order. However, the Problem Solving modules should be taken in order.

Part I: Graph Theory

Required

Part II: Dynamic Programming

Required

Problem Solving A-C

Required

Keep Practicing and Pass the Exam

Also Gain Admission to Your Dream University!

If your level does not fit into the cases below, contact us for a complimentary evaluation assistance.
Part I

Ideally you have passed the Silver exam already. Alternatively, if you successfully completed Silver Problem Solving III class or can solve more than two questions in a Silver exam, you can ease into Gold training with this class provided that you keep practicing for Silver contest.

Part II

Ideally you have completed Part I already, however, this is not strictly required. You can take this class before Part I.

Problem Solving

You must have successfully completed both Part I and Part II modules in full to begin Problem Solving series. Problem Solving classes must be taken in order since they feature increasingly harder problems.

Graph Theory
$600.00
for 20 lessons
Only
$20.00
per hour.
Includes pdf course materials or textbook. Promotions are calculated and shown in the cart. Lessons are 90.00 minutes long.
Hover over an option to view details. Select with a click.
Type
Module
Section

Self Paced classes are saved version of a recently conducted live class. The self paced class include the same materials as the live version such as lecture notes, problems, and their solutions. Additionally, full length recordings of the lectures are provided in lieu of the live sessions with the instructor.

Study Anytime, Learn at Your Own Pace!

For flexible pacing, self-paced classes are ideal. You can accelerate, slow down, or revisit recorded lectures as often as you like.

Get Help When Needed

You can ask questions in the class discussion forums, where most are answered by our instructors within a day.

Automatic Grading

You get immediate feedback when you submit your code into our system. For Math classes, multiple choice quizzes are graded automatically.

Full Solutions Provided

We provide detailed solutions to all problems of the class in pdf or text format. You don't need to purchase a separate textbook to check your work.

Access for the Lifetime of the Class

You have guaranteed access to the class for one calendar year. Beyond that, you get free access upon request if the class is still offered.

Progress Checkpoints

You can track your progress with built-in midterm and final exams that mirror official contests, with automatic scoring for instant feedback.

Gold Graph Theory module covers the following essential Gold level algorithm and data structure topics centered around Graph Theory.
Bit Manipulation
Built-in Data Structures
Disjoint Data Structures
Binary Indexed Tree
Graph Data Structure
Minimum Spanning Tree
Shortest Path
Directed Acyclic Graphs
Tree Algorithms
Gold Dynamic Programming module covers the following essential Gold level algorithm and data structure topics centered around Dynamic Programming.
Dynamic Programming
Longest Increasing Subsequence
Longest Common Subsequence
Edit Distance Algorithms
Subset Sum and Knapsack
Dynamic Programming on Trees
Advanced BFS
Range Queries
Queries on a Tree
Computational Geometry

Gold Problem Solving A class reviews past USACO problems to show how foundational algorithms can be used in many different ways. At the end of the class you will be able to solve easy to intermediate level USACO Gold problems.

Code in your preferred language

The class is language agnostic. Instructors use pseudo language when necessary to explain programming concepts. They can assist C++ and Java users when they need help.

Thirty actual USACO Problems

This module includes about 30 detailed USACO Gold problem categorized by the primary concept involved in their solutions.

Gold Problem Solving B class reviews past USACO problems in chronological order to improve problem solving skills. At the end of the class you will be able to solve intermediate to hard level USACO Gold problems.

Each class includes several problems from past USACO contests. After presenting a problem, the instructor guides students toward a viable solution through critical questions and helpful hints. At the end of the discussion, the instructor presents a comprehensive solution focusing on the topics of the day. Students are expected to implement the solution as homework.

Problem Solving classes are classes that help students master the problem solving skills necessary to pass the target exams. This is as opposed to the Foundation Classes where curriculum elements are systematically introduced from scratch. You can take any number of Problem Solving classes. However, you should observe their order as they feature increasingly harder problems.

Code in your preferred language

The class is language agnostic. Instructors use pseudo language when necessary to explain programming concepts. They can assist C++ and Java users when they need help.

USACO Problems fom the last Five Years

This module includes 45 detailed USACO Gold contest problems from the December, January, and February contests of the last four years, presented in chronological order.