USACO Silver C++ Course - Part 1
- Comfortable programming in C++
Prepare for the USA Computing Olympiad (USACO) Silver Competitions and other programming contests! This course is the first part of a series that will give you an overview of the algorithms you need to perform well in contests such as USACO, Codeforces, and more. This course will specifically cover how to sort in Java/C++ and how to solve sorting-related problems.
STL Sort Function and Comparator
Structures and Sorting
Websites/Contest Sites Used
This course will contain problems from these websites. It is recommended that you make an account (free) on these websites so you can solve the problems we will go over.
Suitable for beginner programmers. It is preferred that you are familiar with the C++ programming language. This course will contain lectures on sorting and video solutions to actual Codeforces/USACO problems.
Comfortable with programming in C++
Who this course is for
Anyone who is interested in competitive programming
Anyone who is interested in learning more about algorithms and data structures
Anyone who wants to prepare for the USACO Silver competitions
Who this course is for:
- Anyone aiming to qualify for USACO Gold
- Anyone interested in algorithms and data structures
- Anyone interested in competitive programming
- 04:46Intro to Big O Notation and Time Complexity
- 04:27Time Complexity Applications in USACO
AlgoSTEM is an organization led by Arushi and Akshaj Gupta. Both have past experience in competitive programming and understand the fundamentals behind advanced algorithms and data structures.
AlgoSTEM also has a popular Youtube channel that covers solutions to coding problems including those from Leetcode, Codeforces, and Codechef.
Sama Setty is a senior at Washington High School in Fremont, CA. As an experienced competitive programmer, she has taught algorithms at her high school, AlphaStar Academy, and various libraries around the Bay Area. She began creating her own curriculum targeted for programmers interested in competing after noticing a need for students to have access to free and readily-available resources.