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.
Binary Search
Frequency array
Prefix sums and Difference array
Greedy Algorithms
Two Pointers
Sliding Window
Дар бораи техникаи равзанаи лағжанда омӯзед
Problems for practice
Ad-hoc heavy-implementation
Problems for practice
Binary Numbers and Binary operations
Рақамҳои дуӣ чистанд ва онҳо чӣ маъно доранд?
Амалиётҳои битӣ
Graph definition and properties, Graph varieties, Graph representations
Омӯзиши таърифҳои асосии назарияи графҳо
Problems for practice
Introduction to Combinatorics
Introduction to Combinatorics
Коэффисиентҳои биномиалӣ
Euclidean Algorithm, Tree Traversal Algorithms, Backtracking with memoization
Рекурсия бо нигоҳдорӣ
Visit all subsets, Visit all permutations
Ҷустуҷӯи пурра