16 модулҳо
48 дарсҳо
12 min
Забони барномасозии C++ барои барномасозии рақобатӣ
Асосҳои барномасозиро тавассути машқҳои амалӣ ва мисолҳои амалӣ омӯзед.
Курсҳо
Маҷмӯи курсҳои мукаммали моро барои ёрӣ расонидан дар ҳалли мушкилоту имкониятҳои ҳаёти шумо омӯзед.
14 модулҳо
56 дарсҳо
Забони барномасозии Python барои барномасозии рақобатӣ
Асосҳои барномасозиро тавассути машқҳои амалӣ ва мисолҳои амалӣ омӯзед.
12 модулҳо
19 дарсҳо
Course 1
Build the core problem-solving skills every competitive programmer needs. This course introduces essential techniques such as binary search, prefix sums, greedy algorithms, two pointers, sliding window, recursion, complete search, and the first basics of graphs and combinatorics.
8 модулҳо
21 дарсҳо
Course 2
Learn the main ideas that form the backbone of contest problem solving. This course covers dynamic programming, number theory, graph traversals, shortest paths, geometry, scanline, basic game theory, and more advanced forms of binary search.
8 модулҳо
18 дарсҳо
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.
9 модулҳо
14 дарсҳо
Course 4
Study the powerful techniques and data structures used in harder problems. This course covers trie, sparse table, segment tree, lazy propagation, tree techniques, binary jumping, divide and conquer, cyclic games, and sqrt methods.
10 модулҳо
21 дарсҳо
Course 5
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.