Preparation to IOI Part 1 - Comprehensive Course

Харитаи курс

Preparation to IOI Part 1

0 аз 17 дарс

0 аз 1 дарс

Binary Search Basics

0 аз 2 дарс

0 аз 2 дарс

0 аз 1 дарс

0 аз 1 дарс

0 аз 1 дарс

0 аз 1 дарс

0 аз 2 дарс

0 аз 1 дарс

0 аз 2 дарс

0 аз 1 дарс

0 аз 1 дарс

0 аз 1 дарс

марра!

Асосӣ Курсҳо Манбаъҳо Масъалаҳо

Асосӣ/Курсҳо/Preparation to IOI Part 1

Омодагӣ ба олимпиада

Preparation to IOI Part 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.

13 модулҳо
17 дарсҳо

Курсро оғоз кунед Ҷадвали натиҷаҳо

Дар ин курс 9 дарс бо Премиум кушода мешавад.

Дидани нақшаҳо

бо пайраҳа равед

Харитаи курс

иҷро шуд
аз ин ҷо сар кунед
дар пеш

Binary Search
1. аз ин ҷо сар кунедBinary Search BasicsНазарияA fast search method that finds targets in a sorted array by repeatedly cutting the search area in half.Дарсро кушоед
Frequency array
1. Frequency ArrayНазарияHow frequency array works and created
2. Frequency array: Example on stringsНазарияFrequency array: Example on strings
Prefix sums and Difference array
1. Prefix sumsНазарияHow to build prefix sums
2. Difference arrayНазарияHow to build difference array
Greedy Algorithms
1. Greedy AlgorithmsНазарияDiscussion of greedy algorithms are strategies
Two Pointers
1. Two PointersБо Премиум кушода мешавадTurning a nested O(n²) loop into a single O(n) sweep by moving two indices across the array together, using monotonicity to make sure neither one ever slides backwards.
Sliding Window
1. Sliding WindowБо Премиум кушода мешавадProcessing every fixed-length window of an array in O(n) total by updating a running summary as one element enters on the right and another leaves on the left — with a monotonic deque as the standard tool for window minimum and maximum.
Ad-hoc heavy-implementation
1. Ad-hoc Heavy-implementationНазарияAd hoc problems are those whose solutions do not fall into any standard algorithmic category.
Binary Numbers and Binary operations
1. Binary NumbersБо Премиум кушода мешавадWhat are binary numbers and what they mean?
2. Bitwise operationsБо Премиум кушода мешавадBitwise operations
Graph definition and properties, Graph varieties, Graph representations
1. Introduction to GraphsБо Премиум кушода мешавадLearn what type of graphs exists and type of graph representations
Introduction to Combinatorics
1. Introduction to CombinatoricsБо Премиум кушода мешавадIntroduction to Combinatorics
2. Binomial coefficientsБо Премиум кушода мешавадBinomial coefficients
Euclidean Algorithm, Tree Traversal Algorithms, Backtracking with memoization
1. Recursion with memoizationБо Премиум кушода мешавадRecursion with memoization
Visit all subsets, Visit all permutations
1. Complete searchБо Премиум кушода мешавадComplete search
Number Theory
1. GCD, LCM, and Euclid's AlgorithmНазарияGCD, LCM, and Euclid's Algorithm

марра!