Probleme

Ușor · Implementation

Mediu · Greedy algorithms · Sorting

Mediu · Breadth-first Search · Graphs

Dificil · Greedy algorithms · Prefix Sums · Sorting · Data Structures

Mediu · Greedy algorithms · String suffix structures

Ușor · Dynamic programming · Graphs

Dificil · Dynamic programming

Foarte dificil · Segment Tree · Sorting · Queries

Foarte dificil · Trees · Depth-first Search · Data Structures · Divide and Conquer

Ușor · Divide and Conquer · Math · Number theory

Ușor · Implementation

Foarte ușor · Greedy algorithms · Prefix Sums

Ușor · Sorting

Dificil · Sorting · Prefix Sums · Greedy algorithms

Mediu · Greedy algorithms · Sorting · Prefix Sums · Two pointers

Mediu · Trees · Depth-first Search

Dificil · Disjoint set union · Sorting · Greedy algorithms · Queries

Foarte ușor · Graphs

Foarte dificil · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Ușor · Dynamic programming · Greedy algorithms

Ușor · Graphs · Trees

Dificil · Greedy algorithms · Sorting · Scanline / Sweep Line · Data Structures · Combinatorics · Prefix Sums

Foarte ușor · Trees

Foarte ușor · Trees · Depth-first Search

Foarte ușor · Interactive