Learn algorithms and data structures step by step. Complete each module, solve problems, and earn a certificate.
Kompyuter nima, CPU, RAM, xotira, operatsion tizim, internet, algoritm — eng oddiy tushunchalardan boshlaymiz.
Dasturlash tili, kompilyator, psevdokod, blok-sxema, sonlar tizimi, IDE o'rnatish.
Python'da birinchi dasturdan boshlab kiritish-chiqarish, son va satr turlari, arifmetika va xatolarni o'qishgacha. Har mavzu oxirida yechiladigan masala bor.
if, else, elif, taqqoslash operatorlari, zanjirli taqqoslash, and/or/not, in, shartli ifoda va match. Har mavzuda Python'da tasdiqlangan masala bor.
for va range, while, break/continue va Python'ga xos for...else, ichma-ich sikllar, naqsh chiqarish, yig'uvchi naqsh, raqamlar bilan ishlash, cheksiz sikl va TLE. Har mavzuda Python'da tasdiqlangan masala bor.
list yaratish va indeks, kesish (slicing), nusxa olish tuzog'i, qidirish, saralash, satr metodlari, split/join, matritsa va [[0]*m]*n tuzog'i, set va deque bilan amallar narxi. Har mavzuda Python'da tasdiqlangan masala bor.
Funksiya yaratish, parametrlar, return, prototip, overloading, lambda.
Rekursiya tushunchasi, turlari, backtracking, rekursiya masalalari.
Bubble, Selection, Insertion, Merge, Quick sort — saralash asoslari.
Binary search, two pointers, qidiruv masalalari.
Tub sonlar, Eratosfen, mod arifmetika, GCD — CP uchun matematika.
pair, map, set, stack, queue, priority_queue — C++ STL.
Hash table, map vs unordered_map, singly/doubly/circular linked list.
Binary tree, BST, heap, trie, DSU — tree ma'lumot tuzilmalari.
Graf tushunchasi, BFS, DFS, cycle detection, topological sort, bipartite.
Dijkstra, Bellman-Ford, Floyd-Warshall, Prim, Kruskal, LCA.
Segment tree, lazy propagation, Fenwick tree, range query tuzilmalari.
DP patternlari, Knapsack, LIS, LCS, Bitmask DP, Interval DP.
KMP, Z-function, String Hashing, Trie, Aho-Corasick.
Tub sonlar, GCD/LCM, modular arifmetika, kombinatorika.
P/N pozitsiyalar, Nim o'yini, Sprague-Grundy teoremasi.
Nuqtalar, vektorlar, chiziqlar, segmentlar, convex hull.
Bridges, Articulation Points, SCC, Topological Sort, DAG DP.
DSU, Sparse Table, SQRT Decomposition, Mo's Algorithm.
Max Flow (Ford-Fulkerson, Edmonds-Karp, Dinic), Min Cut, Bipartite Matching.
Vaqt boshqaruvi, debugging, stress testing, CP template, master cheat sheet.
Sprague-Grundy, Interactive, Constructive, Meet in the Middle.
Cross product, Convex Hull, Closest Pair, Polygon.
Contest strategiya, template, virtual contestlar, final exam.
Sign up to save your progress, earn a certificate, and unlock all features.
HackNowHackNow