Master advanced ideas for high-level problems. This course includes string algorithms, advanced graph algorithms, deeper dynamic programming techniques, Fenwick tree, meet-in-the-middle, centroid decomposition, virtual trees, parallel binary search, and other advanced topics.
Xeshlash, Z funksiyasi, Prefiks funksiya, Manaker algoritmi
String Hashing Algorithms
Z-funksiyasi
Prefiks funksiyasi. Knut-Morris-Pratt algoritmi
Manaker algoritmi
Graf algoritmlari
Kun algoritmi — ikki ulushli (bipartite) grafda maksimal juftlashtirish
Kyonig teoremasi
Osilgan daraxtda DP, DAGda DP, bog‘langan komponentda DP va hokazo
DAGda DP
DP qism daraxti
Bog‘langan komponentlar bo‘yicha DP
Combinatorics
Qo‘shish-ayirish (ilg‘or)
Meet-in-the-middle, yechimlarni o'rtada uchrashtirish
O‘rtada uchrashish
Fenvik daraxti
Fenvik daraxti
Sentroid dekompozitsiyasi
Sentroid dekompozitsiyasi
Virtual daraxtlar
Virtual Tree / Auxiliary Tree
Parallel Ikkilik Qidiruv
Parallel ikkilik qidiruv
Bitset yordamida yechimlarni tezlashtirish
Bitsetlar yordamida optimallashtirish
Hashing techniques
Ochiq va yopiq interval bilan fokus
Qism massivlar bo‘yicha DP
Submask (bitmask) bo‘yicha DP
Digit DP - sonning raqamlari bo'yicha DP