Competitive Programming with USACO Plat+ Competitor
SAT Score Range
•
5 sessions
✨ Be the first
About
Welcome to a series about competitive programming! Regardless of your current skill level, feel free to join this course. Experience in any programming language (C++, Java, Python, etc.) is welcome!
There is a curriculum including core concepts from USACO silver, but discussion is open to all divisions. This course embraces a flexible teaching style, which means often delving deeper into interesting or student-suggested topics.
The silver curriculum includes:
1. Time Complexity and Basic Data Structures
2. Sorting, Binary Search, Prefix Sums
3. Trees and Graphs
4. Greedy Algorithms
5. Introduction to Dynamic Programming
The focus of this course is both to learn algorithmic techniques for solving problems and to grow to appreciate the beauty behind these algorithms.
Tutored by
✋ ATTENDANCE POLICY
Please make sure to join the sessions, and message the tutor if you are unavailable.
SESSION 1
17
Oct
SESSION 1
Other Topics
Other Topics
Fri 12:30 AM - 1:45 AM UTCOct 17, 12:30 AM - 1:45 AM UTC
Time Complexity and Basic Data Structures
SESSION 2
24
Oct
SESSION 2
Other Topics
Other Topics
Fri 12:30 AM - 1:45 AM UTCOct 24, 12:30 AM - 1:45 AM UTC
Sorting, Binary Search, Prefix Sums
SESSION 3
31
Oct
SESSION 3
Other Topics
Other Topics
Fri 12:30 AM - 1:45 AM UTCOct 31, 12:30 AM - 1:45 AM UTC
Trees and Graphs
SESSION 4
7
Nov
SESSION 4
Other Topics
Other Topics
Fri 1:30 AM - 2:45 AM UTCNov 7, 1:30 AM - 2:45 AM UTC
Greedy Algorithms
SESSION 5
14
Nov
SESSION 5
Other Topics
Other Topics
Fri 1:30 AM - 2:45 AM UTCNov 14, 1:30 AM - 2:45 AM UTC
Introduction to Dynamic Programming