Silver
The topics below are not exhaustive for this division.
Contest problems may contain topics not covered in the guide, or topics listed under different divisions!
If you prefer videos instead of text, check out CPI's free self-study Silver course.
Modules Progress
Problems Progress
Prefix Sums
Sorting & Searching
Two Pointers
Not Frequent
Iterating two monotonic pointers across an array to search for a pair of indices satisfying some condition in linear time.
Updated: Last week
Binary Search on a Sorted Array
Somewhat Frequent
Efficiently searching for a value in a sorted array.
Updated: Last week
Binary Search
Somewhat Frequent
Binary searching on arbitrary monotonic functions.
Updated: Last week
Custom Comparators and Coordinate Compression
Somewhat Frequent
Using a custom comparator to sort custom objects or values in a non-default order, and compressing values from a large range to a smaller one.
Updated: Last week
Greedy Algorithms with Sorting
Somewhat Frequent
Solving greedy problems by sorting the input.
Updated: Last week
Priority Queues
Not Frequent
A data structure that supports insert, query max, and pop max.
Updated: Last week
Graphs
Most Silver to Platinum contests have at least one graph problem.
Graph Traversal
Very Frequent
Traversing a graph with depth first search and breadth first search.
Updated: Last week
Flood Fill
Somewhat Frequent
Finding connected components in a graph represented by a grid.
Updated: Last week
Introduction to Tree Algorithms
Not Frequent
Introducing a special type of graph: trees.
Updated: Last week
Introduction to Functional Graphs
Not Frequent
Directed graphs in which every vertex has exactly one outgoing edge.
Updated: Yesterday
Additional Topics
Conclusion
Congratulations on making it this far!