Problemat

E lehtë · Scanline / Sweep Line · Sorting · Data Structures · Geometry

Mesatare · Dijkstra algorithm · Shortest paths · Graphs

Shumë e lehtë · Dynamic programming · Graphs · Shortest paths

E vështirë · Sorting · Geometry

E vështirë · Dynamic programming · Bitmasks · Binary Search

Shumë e vështirë · Depth-first Search · Dynamic programming · Graphs · Shortest paths

E lehtë · Greedy algorithms · Strings

Mesatare · Greedy algorithms · Math

E vështirë · Combinatorics · Sorting · Greedy algorithms

E vështirë · Graphs · Depth-first Search · Disjoint set union · Implementation

E vështirë · Greedy algorithms · Stacks · Prefix Sums · Queries

E vështirë · Constructive Algorithms · Greedy algorithms · Prefix Sums

Shumë e lehtë · Bitmasks · Dynamic programming · Combinatorics

E vështirë · Shortest paths · Breadth-first Search · Graphs

Shumë e vështirë · Graphs · Sorting · Two pointers · Data Structures

E vështirë · Breadth-first Search · Graphs · Combinatorics · Prefix Sums · Number theory

Shumë e vështirë · Dynamic programming · Dynamic Programming Optimization · Binary Search · Stacks

Shumë e vështirë · Graphs · Depth-first Search · Fenwick Tree · Prefix Sums · Data Structures

Mesatare · Implementation

E lehtë · Implementation

Shumë e lehtë · Math · Geometry

E vështirë · Breadth-first Search · Greedy algorithms

Mesatare · Greedy algorithms · Sorting

Shumë e vështirë · Dynamic programming · Prefix Sums · Data Structures

E vështirë · Games · Combinatorics · Prefix Sums · Number theory · Greedy algorithms