Course 3 - Comprehensive Course

Module 1: 2D DP

Longest common subsequence (LCS)
Longest Increasing Subsequence (LIS)
Longest Increasing Subsequence (LIS) in $O(N \log N)$
Knapsack problem
Lazy DP

Module 2: DSU

System of disjoint sets

Module 3: MST

Minimum and maximum spanning trees
Kruskal's Algorithm
Prim's Algorithm
Borůvka's Algorithm

Module 4: Combinatorics

Stars and columns
The principle of inclusion-exclusion

Module 5: Geometry

Finding the area of a simple polygon

Module 6: Arbitrary-Precision Arithmetic

Long Arithmetic

Module 7: Data structures for keeping minimum

Stack with Minimum
Queue with Minimum
Deque with Minimum

Module 8: Heap [BONUS]

Binary Heap

Home Courses Resources Problems National Olympiad Contests Leaderboard

...

Home/Courses/Course 3

Course 3

Move beyond the basics and learn how to solve more technical and structured problems. This course includes 2D dynamic programming, DSU, MST, combinatorics, geometry, heaps, arbitrary-precision arithmetic, and useful optimization techniques.

8 modules

·

18 lessons

Part 1

Module 1: 2D DP

LCS/LIS, Knapsack

Longest common subsequence (LCS)
Longest Common Subsequence (LCS)
Longest Increasing Subsequence (LIS)
Longest increasing subsequence (LIS)
Longest Increasing Subsequence (LIS) in $O(N \log N)$
Longest Increasing Subsequence (LIS) in $O(N \log N)$

Knapsack problem

Knapsack problem

Lazy DP

Lazy DP

Part 2

Module 2: DSU

Disjoint-Set Union

System of disjoint sets
System of disjoint sets

Part 3

Module 3: MST

Prim, Kruskal, Boruvka

Minimum and maximum spanning trees
Minimum and maximum spanning trees
Kruskal's Algorithm
Kruskal's Algorithm
Prim's Algorithm
Prim's Algorithm
Borůvka's Algorithm
Borůvka's algorithm

Part 4

Module 4: Combinatorics

Combinatorics

Stars and columns
Stars and columns
The principle of inclusion-exclusion
The principle of inclusion-exclusion

Part 5

Module 5: Geometry

Geometry

Finding the area of a simple polygon
Finding the area of a simple polygon

Part 6

Module 6: Arbitrary-Precision Arithmetic

Arbitrary-Precision Arithmetic

Long Arithmetic
Long Arithmetic

Part 7

Module 7: Data structures for keeping minimum

Data structures for keeping minimum

Stack with Minimum
Stack with Minimum
Queue with Minimum
Queue with Minimum
Deque with Minimum
Deque with Minimum

Part 8

Module 8: Heap [BONUS]

Heap

Binary Heap
Binary Heap