Bronze

Time Complexity

Measuring the number of operations an algorithm performs.

Introduction to Data Structures

What a data structure is, (dynamic) arrays, pairs, and tuples.

Simulation

Very Frequent

Directly simulating the problem statement.

Basic Complete Search

Very Frequent

Problems involving iterating through the entire solution space.

Complete Search with Recursion

Rare

Harder problems involving iterating through the entire solution space, including those that require generating subsets and permutations.

Introduction to Sorting

Not Frequent

Arranging collections in increasing order.

(Optional) Introduction to Sets & Maps

Not Frequent

Maintaining collections of distinct elements/keys with sets and maps.

Ad Hoc Problems

Very Frequent

Problems that do not fall into standard categories with well-studied solutions.

Introduction to Greedy Algorithms

Not Frequent

Problems that can be solved by selecting the choice that seems to be the best at the moment at every step.

Introduction to Graphs

Somewhat Frequent

What graphs are.

Rectangle Geometry

Rare

Problems involving rectangles whose sides are parallel to the coordinate axes.

Additional Practice for USACO Bronze

Final tips for Bronze and additional practice problems.