Задачи

Лесно · Trees · Depth-first Search · Prefix Sums

Много трудно · Segment Tree · Greedy algorithms · Dynamic programming

Лесно · Segment Tree · Range queries

Много лесно · Brute force

Средно · Combinatorics · Number theory · Brute force

Много лесно · Greedy algorithms · Sorting · Implementation

Трудно · Meet-in-the-middle · Hashing · Strings

Средно · Brute force · Number theory · Combinatorics

Трудно · Sorting · Two pointers · Greedy algorithms · Binary Search

Трудно · Breadth-first Search · Dynamic programming · Shortest paths · Sorting · Graphs

Трудно · Dynamic programming · Prefix Sums

Трудно · Greedy algorithms · Sorting · Data Structures

Средно · Strings · Stacks

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

Средно · Dynamic programming

Лесно · Strings · Prefix Function · Data Structures · Stacks

Средно · Dynamic programming

Лесно · Greedy algorithms · Priority Queue · Graphs

Лесно · Dynamic programming · Fenwick Tree · Data Structures · Prefix Sums

Трудно · Strings · Hashing · Data Structures

Много трудно · Divide and Conquer · Convex Hull · Data Structures

Много лесно · Brute force

Трудно · Greedy algorithms · Graphs · Shortest paths

Много лесно · Binary Search · Math · Two pointers

Средно · Bitmasks · Brute force · Shortest paths