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!
Modules Progress
Problems Progress
Prefix Sums
Visual
Sorting & Searching
Custom Comparators and Coordinate Compression
Somewhat Frequent
Using a custom comparator to sort custom objects or values in a non-default order; Coordinate compressing values from a large range to a smaller one.
NaN
Two Pointers
Not Frequent
Iterating two monotonic pointers across an array to search for a pair of indices satisfying some condition in linear time.
NaN
More Operations on Sorted Sets
Not Frequent
Using iterators with sets, finding the next element smaller or larger than a specified key in a set.
NaN
(Optional) C++ Sets with Custom Comparators
Rare
Incorporating custom comparators into standard library containers.
NaN
Greedy Algorithms with Sorting
Somewhat Frequent
Solving greedy problems by sorting the input.
NaN
Binary Search
Somewhat Frequent
Binary searching on arbitrary monotonic functions and built-in functions for binary search.
NaN
Graphs
Every (?) Silver - Plat contest has at least one graph problem.
Depth First Search (DFS)
Very Frequent
Recursively traversing a graph.
NaN
Flood Fill
Somewhat Frequent
Finding connected components in a graph represented by a grid.
NaN
Introduction to Tree Algorithms
Rare
Introducing a special type of graph: trees.
NaN
(Optional) Introduction to Functional Graphs
Rare
Directed graphs in which every vertex has exactly one outgoing edge.
NaN