Задачи

Лесно · Geometry · Binary Search · Ternary search · Convex Hull · Optimization

Средно · Number theory · Math

Много трудно · Sorting · Constructive Algorithms · Greedy algorithms · Interactive

Много трудно · Greedy algorithms · Probabilities · Binary Search · Prefix Sums · Sorting

Лесно · Breadth-first Search · Shortest paths · Graphs · Greedy algorithms

Средно · Greedy algorithms · Brute force

Трудно · Greedy algorithms · Constructive Algorithms

Много трудно · Constructive Algorithms · Graphs · Trees · Greedy algorithms

Средно · Graphs

Много лесно · Greedy algorithms · Hashing · Two pointers

Средно · Strings · Two pointers · Greedy algorithms

Много лесно · Graphs · Depth-first Search · Constructive Algorithms

Средно · Dynamic programming · Dynamic Programming Optimization · Greedy algorithms

Много лесно · Implementation

Много лесно · Implementation

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

Много лесно · Math

Много лесно · Two pointers · Prefix Sums

Лесно · Sorting · Brute force

Много лесно · Breadth-first Search · Graphs

Средно · Greedy algorithms · Sorting

Много лесно · Prefix Sums

Лесно · Greedy algorithms · Data Structures · Sorting

Средно · Dynamic programming

Трудно · Breadth-first Search · Shortest paths