Preparation to IOI Part 1 - Comprehensive Course

Module 1: Binary Search

Binary Search

Module 2: Frequency array

Frequency Array
Frequency array: Example on strings

Module 3: Prefix sums and Difference array

Prefix sums
Difference array

Module 4: Greedy Algorithms

Greedy Algorithms

Module 5: Two Pointers

Two Pointers Technique

Module 6: Sliding Window

Sliding Window Technique

Module 7: Ad-hoc heavy-implementation

Ad-hoc Heavy-implementation

Module 8: Binary Numbers and Binary operations

Binary Numbers
Bitwise operations

Module 9: Introduction to Graphs

Basic definitions of graph theory

Module 10: Introduction to Combinatorics

Introduction to Combinatorics
Binomial coefficients

Module 11: More on Recursion

Recursion with memoization

Module 12: Complete Search

Complete search

Home Courses Resources Problems National Olympiad Contests Leaderboard

...

Home/Courses/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.

12 modules

·

16 lessons

Start the course View Standings

Part 1

Module 1: Binary Search

Binary Search

Binary Search
How binary search works and why it is important algorithm

Part 2

Module 2: Frequency array

Frequency array

Frequency Array

How frequency array works and created

Frequency array: Example on strings

Frequency array: Example on strings

Part 3

Module 3: Prefix sums and Difference array

Prefix sums and Difference array

Prefix sums
How to build prefix sums
Difference array
How to build difference array

Part 4

Module 4: Greedy Algorithms

Greedy Algorithms

Greedy Algorithms
Discussion of greedy algorithms are strategies

Part 5

Module 5: Two Pointers

Two Pointers

Two Pointers Technique
Learn how two pointers technique works

Part 6

Module 6: Sliding Window

Sliding Window

Sliding Window Technique
Learn about sliding window technique

Part 7

Module 7: Ad-hoc heavy-implementation

Ad-hoc heavy-implementation

Ad-hoc Heavy-implementation
Ad hoc problems are those whose solutions do not fall into any standard algorithmic category.

Part 8

Module 8: Binary Numbers and Binary operations

Binary Numbers and Binary operations

Binary Numbers
What are binary numbers and what they mean?
Bitwise operations
Bitwise operations

Part 9

Module 9: Introduction to Graphs

Graph definition and properties, Graph varieties, Graph representations

Basic definitions of graph theory
Learn Basic definitions of graph theory

Part 10

Module 10: Introduction to Combinatorics

Introduction to Combinatorics

Introduction to Combinatorics
Introduction to Combinatorics
Binomial coefficients
Binomial coefficients

Part 11

Module 11: More on Recursion

Euclidean Algorithm, Tree Traversal Algorithms, Backtracking with memoization

Recursion with memoization
Recursion with memoization

Part 12

Module 12: Complete Search

Visit all subsets, Visit all permutations

Complete search
Complete search