Probleme

Ușor · Dynamic programming · Divide and Conquer

Foarte dificil · Dynamic programming · Number theory · Combinatorics

Foarte dificil · Segment Tree · Range queries · Queries · Data Structures

Foarte dificil · Breadth-first Search · Graphs · Constructive Algorithms · Number theory

Foarte dificil · Graphs · Breadth-first Search · Combinatorics · Dynamic programming

Ușor · Combinatorics · Prefix Sums · Greedy algorithms

Ușor · Greedy algorithms · Prefix Sums

Foarte ușor · Dynamic programming · Combinatorics · Constructive Algorithms · Greedy algorithms

Dificil · Greedy algorithms · Sorting · Two pointers

Ușor · Disjoint set union · Greedy algorithms · Sorting

Mediu · Prefix Sums · Sorting · Combinatorics

Foarte dificil · Dynamic programming · Greedy algorithms · Binary Search · Sorting

Foarte dificil · Data Structures · Greedy algorithms · Constructive Algorithms

Foarte dificil · Graphs · Constructive Algorithms · Sorting · Stacks

Foarte dificil · Dijkstra algorithm · Segment Tree · Graphs · Shortest paths

Ușor · Dynamic programming · Greedy algorithms · Two pointers

Foarte dificil · Combinatorics · Dynamic programming · Probabilities

Foarte ușor · Greedy algorithms · Sorting · Binary Search

Dificil · Greedy algorithms · Sorting · Constructive Algorithms

Dificil · Greedy algorithms · Combinatorics

Dificil · Depth-first Search · Dynamic programming · Bitmasks

Mediu · Brute force · Combinatorics

Mediu · Binary Search · Greedy algorithms · Sorting

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

Ușor · Graphs · Greedy algorithms · Disjoint set union · Sorting