Learn the main ideas that form the backbone of contest problem solving. This course covers dynamic programming, number theory, graph traversals, shortest paths, geometry, scanline, basic game theory, and more advanced forms of binary search.
Scanline
What type of scanline problems exists
Problems for practice
Introduction to DP
Learn basic concepts of dynamic programming
Primality testing in $O(\sqrt{n})$, Sieve of Eratosthenes, Factorization in $O(\sqrt{n})$
In this section we will study checking a number for primality, how to find all divisors of a number up to $\sqrt{N}$ and factoring a number into prime numbers
Learn about sieve of Eratosthenes
DFS, BFS, Visit components, 2-coloring the graph, Cycle detection (in oriented and non-oriented), Topological Sorting
Learn Depth-First Search (DFS)
Learn about Breadth-First Search (BFS)
Bipartiteness check
Finding connected components
Topological sorting
Dijkstra Algorithm, Bellman-Ford, Floyd Warshall
Learn about Dijkstra's algorithm
Learn Floyd–Warshall Algorithm
Bellman–Ford algorithm
Game Theory - Basics
Learn basics of game states
Introduction to Geometry
Signed area of a triangle
Basic Geometry
Harder geometry problems
Binary Search on Answer, Binary Search on floating numbers, Ternary Search, 2-pow Binary Search
Binary search by answer
Binary search on a real-valued answer
Ternary search
Binary search by powers of two