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.
LCS/LIS, Knapsack (sumka)
Eng uzun umumiy qismketma-ketlik (LCS)
Eng uzun o‘suvchi qism-ketma-ketlik
Eng uzun o'suvchi qism ketma-ketlik (LIS) $O(N \log N)$ vaqt ichida
Ryukzak masalasi
Lazy DP
Disjoint-Set Union
Kesishmaydigan to‘plamlar tizimi
Prim, Kruskal, Boruvka
Minimal va maksimal qamrovchi daraxtlar
Kruskal algoritmi
Prim algoritmi
Kombinatorika
Yulduzlar va ustunlar
Qo‘shish-ayirish prinsipi
Geometriya
Finding the area of a simple polygon
Uzun sonli arifmetika
Uzun arifmetika
Minimum saqlash uchun strukturalar
Minimumli stek
Minimumli navbat
Minimumli deque
Heap
Heap (Ikkilik uyma)
Boruvka algoritmi