Republic Olympiad Topics for preparation

====== lvl 1 | basic knowledge =====

Introductory lesson

math (formulas, basic mathematic operations)

if/else

loop

string, array

asymptotics

sort (bubble, merge)

STL, map, set

======= lvl 2 | pre-intermediate =====

Two pointers

Binary Search/Ternary Search

prefix sum

sliding window

functions / recursion (prime)

Bruteforce

Greedy

scan line

permutation

========= lvl 3 | intermediate ===============

prime, factorization, number theory

dp basic

graph, dfs, bfs

Sieve

combinatorics

modular arith

Hash

========= lvl 4 | upper-intermediate ==========

fenwick tree

sqrt decomposition

Segment Tree

Sparse Table

TopSort

Eulerian cycle, path

Finding path algos

dsu, mst

bitmasks and dp bitmasks

Mo's Algo

digit dp

DP on substring

invariant, monovariant, dirichlet

======== lvl 5 | advanced ========

Cut vertices, edges

SCC

lca

Z algo/Prefix func

trie

meet in the middle

small to large

dp on trees

Inclusion-Exclusion, Probability

Expected val

segment tree lazys

======== lvl 6 | proficient ======

Nim

Persistent Data Structures

Maximum bi-partition (Kuhn's algo)

Matrixes

Author: bash