Задачи

Лесно · 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