Problem Solving Camp

After finishing the Gold Foundations training with Part I and Part II courses, this course will take the student to the next level through a systematic study of harder past USACO questions along the lines of Star League Gold curriculum.

The class is language agnostic. Instructors use pseudo language when necessary to explain programming concepts. However, they are able to help both Java and C++ users when they need help.

Each class features several past USACO problems. After the presentation of a problem instructor steer the students towards an acceptable solution through critical questions and hints. At the end the instructor wraps up the discussion and provides a cohesive solution and ways to optimize it. Students are expected to implement their solution or the presented solution during the Practice time.

During the Practice hours of the day students will get individual help, such as for debugging, to implement the solutions. They will also be able to ask and get clarification about any challenging concepts they encounter during their coding practice.

Colorful Networked Strings
2022 Winter
Mon 26 Dec
Fri 30 Dec
Computer Science Online Camp
5 Daily Meetings. (Mon - Fri )
Dec. 26th to Dec. 30th
Between 8:00am and 3:00pm
America/Los_Angeles (PST)
Schedule Conflict? Check out other options.
This Course Features
  • Live Interactive Instruction
  • Highly Experienced Teacher
  • Proven Curriculum for USACO Silver Preparation
  • 30 Hours of Immersive Problem Solving and Coding
  • Offline Help from Instructors After the Camp
  • Lectures are Recorded and Accessible After the Camp
  • Live Coding Exercises and Implementation Help
  • In Depth Discussion of Solutions
  • Online Instant Scoring for Code Submissions
  • Minimum One Year Access to Course Materials
Register Today and Save
$1000.00 $900.00*
Current Promotions
New Family
Current Family
Sibling Discount
User Discount
Multiple Registration
Referral Credit
*Discounts differ based on your history with us, type and number of courses you are registering, and date. Log in and add all the courses to the cart to view discounts applicable for you.
World Champion (IM Gold)
Pudak Nurberdiyev
+10 Years Teaching Experience
01Bit Manipulation
02Builtin Data Structures
03Disjoint Set Data Structure
04Binary Indexed Tree
05Introduction to Graph Data Structure
06Minimum Spanning Tree (MST)
07Shortest Path: BFS, Dijkstra,Bellman-Ford, Floyd-Warshall
08Directed Acyclic Graphs (DAG)
09Tree Algorithms
01Dynamic Programming
02Longest Increasing Subsequence (LIS)
03Longest Common Subsequence (LCS)
04Edit Distance Algorithms
05Subset Sum, 1-0 Knapsack
06Dynamic Programming on Trees
07Advanced BFS
08Range Queries
09Queries on a Tree
0AComputational Geometry
0BAdvanced Sweep Line
0CCombinatorics, Numeric Algorithms
08:00 am Lecture90 minutes
09:30 am Break15 minutes
09:45 am Practice90 minutes
11:15 am Lunch30 minutes
11:45 am Lecture90 minutes
01:15 pm Break15 minutes
01:30 pm Practice90 minutes
Times shown are in Pacific Time Zone.

Student must have completed Gold Part I and Part 2 courses by coding all of the exercises and problems. Alternately, if a student can consistently solve close to two problems, this course may be taken provided that student is familiar with the Foundations curriculum in Gold Part I and II.

You can either take a published contest at the official USACO website ( or take our Placement test here. First you will need to create an account for the student for the respective site. Please contact us if you encounter any difficulty.