BdOI National

Topics for the national round of the Bangladesh Olympiad in Informatics (targeting ~1500 Codeforces rating).

Dynamic Programming

Introduction to Dynamic Programming

The core concepts of dynamic programming.

Coin Change

The classic coin change problem.

Knapsack DP

The 0/1 knapsack problem.

Longest Common Subsequence

The longest common subsequence (LCS) problem.

Bitmask DP

Learn how to solve problems with dynamic programming and bitmasking.

DP on Trees

Learn how to apply dynamic programming on tree data structures.

Graph Traversal

Depth-First Search (DFS)

The DFS algorithm and its applications.

Breadth-First Search (BFS)

The BFS algorithm and its applications.

Connected Components

Finding connected components in a graph.

Topological Sort

Learn how to perform a topological sort on a directed acyclic graph.

Euler Tour

Learn about Euler tours on trees.

Shortest Paths

Dijkstra's Algorithm

Learn Dijkstra's algorithm for finding the shortest paths in a graph.

Floyd-Warshall Algorithm

Learn the Floyd-Warshall algorithm for all-pairs shortest paths.

Graph Data Structures

Disjoint Set Union (DSU)

Learn about the Disjoint Set Union data structure.

Minimum Spanning Tree (MST)

Learn about Minimum Spanning Trees and algorithms to find them.

Number Theory

Combinatorics

An introduction to combinatorics for competitive programming.

Euler's Totient Function

Learn about Euler's totient function and its properties.

Sieve of Eratosthenes

Learn how to use the Sieve of Eratosthenes to find prime numbers efficiently.

Binary Exponentiation

Learn how to calculate powers efficiently using binary exponentiation.

Data Structures

Segment Tree

Learn about the Segment Tree data structure.