Dive into the fascinating world of algorithms. Achieving success in the Silver contest is no easy task, but it is incredibly rewarding.

The Silver training program is designed to give you a deep and thorough understanding of key concepts like efficiency, complexity, data structures, and the common algorithms tested at the Silver level. It includes two main parts: foundational classes and problem-solving classes.

The foundational classes cover core computing topics like data structures, recursion, searching techniques, graphs, and trees, setting the groundwork for deeper learning. The problem-solving classes focus on applying these concepts, helping you build skills in recognizing and using 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).

Successfully completing the following modules exceeds the curricular requirements of USACO Silver contest.
Foundations Part A

Required

Foundations Part B

Required

Foundations Part C

Required

Foundations Part D

Required

Problem Solving A

Required

Problem Solving B

Required

Problem Solving C

Recommended

Pass Silver Contest

Also sharpen your edge for Top University Admissions.

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

Ideally you have passed the Bronze exam already. Alternatively, if you successfully completed Bronze Problem Solving I class or can solve more than two questions in a Bronze exam, you can ease into Silver training provided that you keep practicing for Bronze contest. You need to take the foundational classes in sequence because each module builds on the concepts introduced in the previous ones.

Problem Solving Classes

You must be proficient in the theoretical concepts of the foundational modules in full to begin Problem Solving series. Problem Solving classes must be taken in order too since they feature increasingly harder problems.

Problem Solving B
$500.00
for 12 Lesson
Only
$27.77
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
Term
Module
Language
Section
We also offer 1-on-1 and small group tutoring for all courses in our catalog. Contact us with the student or group current preparation level, and we’ll create a study plan to help reach their goals.
3 Meetings

Fri - Sun

8:00am - 3:00pm

Daily 7 Hours.

Nov. 29th - Dec. 1st

Total 21 Hours

America/Los_Angeles (PST)

Times are shown in this time zone.

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.

Online Camps are live classes conducted during the school breaks such as summer time or the winter break. Camps are great for students to learn new skills or improve acquired skills through intensive practice.

Accelerates and Boosts Learning

Online camp classes provide highly efficient learning environments, allowing students to cover a semester worth of material in a week.

Builds Confidence with Extra Practice

Online camp classes offer extra practice time, boosting student self-confidence and motivating them to study further.

Interactive Live Instruction

Our teaching platform offers audio-video, live chat, and shared notebooks, allowing students to interact as they prefer, resulting in increased engagement.

Make Up with Daily Recordings

All live camp classes are recorded. If you miss a lesson, you can review the lecture on the same day to catch up and get ready for the next day.

One Year Access

After the scheduled camp sessions are over, you will have access for the recorded version of the class for one calendar year through SLOnline.

Automatic Grading

You get immediate feedback when you submit your code or take a math quiz while doing homework.

Progress Checks

You will be able to take mid-term or final exams to check your progress. They are timed as in actual contests and automatically scored.

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.

Silver Foundations Part A module includes the following essential Silver level algorithm topics centered around Data Structures.
Sorting
Searching
Builtin Data Structures
Strings
Silver Foundations Part B module includes the following essential Silver level algorithm topics centered around the key concept of Recursion.
Recursion
Breadth First Search (BFS)
Backtracking
Divide and Conquer
Depth First Search (DFS)
Flood Fill
Silver Foundations Part C module includes the following essential Silver level algorithm topics introducing Linear Algorithms and Graphs.
Difference Array
Prefix Sum Array
Sliding Window and Two Pointers
Graphs
Silver Foundations Part D module includes the following essential Silver level algorithm topics centered around Tree algorithms.
Tree Algorithms
Bit Manipulation
Greedy Algorithm
Intro to Dynamic Programming
Sweep Line
Geometry
Java is one of the most widely used language for software development across diverse platforms. It also has some popularity in competitive programming circles compared to Python, which is rarely used.
Versatility

Java is used in great many diverse environments. Learning Java by itself is very advantageous in the long term.

AP Computer Science A

College Board's AP Computer Science A course uses Java. If you learn Java in advance with this course, excellent grades and scores are not going to be surprising.

C++ is most widely used language for algorithm intensive tasks in competitive programming. For example, in USACO contests in average about 3/4 of submissions are in C++. If your primary goal is to advance in USACO, we highly recommend to choose C++ as your programming language of choice.
Faster execution

C++ has performance advantage over other languages in its execution speed. At times this may be critical, since programming tasks must be finished in a certain amount of time.

Greater choice of resources

There are widely available examples, solutions, and learning resources in C++ for competitive programming. A brief review of official USACO solutions also reveal that most of them are in C++.

Silver 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 Silver 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.

Fifty actual USACO Problems

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

Silver 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 hard level USACO Silver 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 Four Years

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

Most classes are one week long. They are scheduled from late June through early August. Be sure to check individual class schedules for specific dates and times. Unless otherwise noted all times are in the active Pacific Time Zone (California/Los Angeles).
Short Daily Schedule

Most classes are held only in the morning, allowing you to make the most of the long summer days.

Classes on Some Saturdays

Most classes run on weekdays. However, some classes also run on Saturdays. Double check to see if it affects your schedule.

Classes on July 4th

Enjoy the fireworks at night, but remember that classes are on schedule for the morning of July 4th.

Silver Foundations AB module combines Foundations A and B curriculum. It covers the following essential Silver level algorithm topics centered around Data Structures and Recursion.

Sorting
Searching
Builtin Data Structures
Strings
Recursion
Breadth First Search (BFS)
Backtracking
Divide and Conquer
Depth First Search (DFS)
Flood Fill

Silver Foundations CD module combines Foundations Part C and Part D curriculum. It covers the following essential Silver level algorithm topics introducing Linear Algorithms, Graphs, and Trees.

Difference Array
Prefix Sum Array
Sliding Window and Two Pointers
Graphs
Tree Algorithms
Bit Manipulation
Greedy Algorithm
Intro to Dynamic Programming
Sweep Line
Geometry