Problemat

E lehtë · Dynamic programming · Divide and Conquer

Shumë e vështirë · Dynamic programming · Number theory · Combinatorics

Shumë e vështirë · Segment Tree · Range queries · Queries · Data Structures

Shumë e vështirë · Breadth-first Search · Graphs · Constructive Algorithms · Number theory

Shumë e vështirë · Graphs · Breadth-first Search · Combinatorics · Dynamic programming

E lehtë · Combinatorics · Prefix Sums · Greedy algorithms

E lehtë · Greedy algorithms · Prefix Sums

Shumë e lehtë · Dynamic programming · Combinatorics · Constructive Algorithms · Greedy algorithms

E vështirë · Greedy algorithms · Sorting · Two pointers

E lehtë · Disjoint set union · Greedy algorithms · Sorting

Mesatare · Prefix Sums · Sorting · Combinatorics

Shumë e vështirë · Dynamic programming · Greedy algorithms · Binary Search · Sorting

Shumë e vështirë · Data Structures · Greedy algorithms · Constructive Algorithms

Shumë e vështirë · Graphs · Constructive Algorithms · Sorting · Stacks

Shumë e vështirë · Dijkstra algorithm · Segment Tree · Graphs · Shortest paths

E lehtë · Dynamic programming · Greedy algorithms · Two pointers

Shumë e vështirë · Combinatorics · Dynamic programming · Probabilities

Shumë e lehtë · Greedy algorithms · Sorting · Binary Search

E vështirë · Greedy algorithms · Sorting · Constructive Algorithms

E vështirë · Greedy algorithms · Combinatorics

E vështirë · Depth-first Search · Dynamic programming · Bitmasks

Mesatare · Brute force · Combinatorics

Mesatare · Binary Search · Greedy algorithms · Sorting

E vështirë · Fenwick Tree · Data Structures · Prefix Sums · Greedy algorithms · Sorting

E lehtë · Graphs · Greedy algorithms · Disjoint set union · Sorting