
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.
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)$