Course 2 - Comprehensive Course

Module 1: Scanline

Scanline / Event Processing

Module 2: Introduction to DP

Introduction to Dynamic Programming

Module 3: Number theory

Prime numbers and factorization
Sieve of Eratosthenes

Module 4: Graph traversals

Depth-First Search (DFS)
Breadth-First Search (BFS)
Bipartiteness check
Finding connected components
Topological sorting

Module 5: Shortest paths

Dijkstra's algorithm
Floyd–Warshall Algorithm
Bellman–Ford algorithm

Module 6: Game Theory - Basics

Basics of Game States

Module 7: Introduction to Geometry

Signed area of a triangle
Basic Geometry
Bonus Geometry Problems

Module 8: Various types of Binary Search

Binary search by answer
Binary search on a real-valued answer
Ternary search
Binary search by powers of two

Home Courses Resources Problems National Olympiad Contests Leaderboard

...

Home/Courses/Course 2

Course 2

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.

8 modules

·

20 lessons

Part 1

Module 1: Scanline

Scanline

Scanline / Event Processing
What type of scanline problems exists

Part 2

Module 2: Introduction to DP

Introduction to DP

Introduction to Dynamic Programming
Learn basic concepts of dynamic programming

Part 3

Module 3: Number theory

Primality testing in $O(\sqrt{n})$, Sieve of Eratosthenes, Factorization in $O(\sqrt{n})$

Prime numbers and factorization
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
Sieve of Eratosthenes
Learn about sieve of Eratosthenes

Part 4

Module 4: Graph traversals

DFS, BFS, Visit components, 2-coloring the graph, Cycle detection (in oriented and non-oriented), Topological Sorting

Depth-First Search (DFS)
Learn Depth-First Search (DFS)
Breadth-First Search (BFS)
Learn about Breadth-First Search (BFS)
Bipartiteness check
Bipartiteness check
Finding connected components
Finding connected components
Topological sorting
Topological sorting

Part 5

Module 5: Shortest paths

Dijkstra Algorithm, Bellman-Ford, Floyd Warshall

Dijkstra's algorithm
Learn about Dijkstra's algorithm
Floyd–Warshall Algorithm
Learn Floyd–Warshall Algorithm
Bellman–Ford algorithm
Bellman–Ford algorithm

Part 6

Module 6: Game Theory - Basics

Game Theory - Basics

Basics of Game States
Learn basics of game states

Part 7

Module 7: Introduction to Geometry

Introduction to Geometry

Signed area of a triangle
Signed area of a triangle
Basic Geometry
Basic Geometry
Bonus Geometry Problems
Harder geometry problems

Part 8

Module 8: Various types of Binary Search

Binary Search on Answer, Binary Search on floating numbers, Ternary Search, 2-pow Binary Search

Binary search by answer
Binary search by answer
Binary search on a real-valued answer
Binary search on a real-valued answer
Ternary search
Ternary search
Binary search by powers of two
Binary search by powers of two