Задачи

Лесно · Implementation

Средно · Greedy algorithms · Sorting

Средно · Breadth-first Search · Graphs

Тешко · Greedy algorithms · Prefix Sums · Sorting · Data Structures

Средно · Greedy algorithms · String suffix structures

Лесно · Dynamic programming · Graphs

Тешко · Dynamic programming

Многу тешко · Segment Tree · Sorting · Queries

Многу тешко · Trees · Depth-first Search · Data Structures · Divide and Conquer

Лесно · Divide and Conquer · Math · Number theory

Лесно · Implementation

Многу лесно · Greedy algorithms · Prefix Sums

Лесно · Sorting

Тешко · Sorting · Prefix Sums · Greedy algorithms

Средно · Greedy algorithms · Sorting · Prefix Sums · Two pointers

Средно · Trees · Depth-first Search

Тешко · Disjoint set union · Sorting · Greedy algorithms · Queries

Многу лесно · Graphs

Многу тешко · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Лесно · Dynamic programming · Greedy algorithms

Лесно · Graphs · Trees

Тешко · Greedy algorithms · Sorting · Scanline / Sweep Line · Data Structures · Combinatorics · Prefix Sums

Многу лесно · Trees

Многу лесно · Trees · Depth-first Search

Многу лесно · Interactive