Problemat

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

Shumë e vështirë · Segment Tree · Data Structures · Scanline / Sweep Line · Greedy algorithms

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

Shumë e vështirë · Dynamic programming · Prefix Sums · Combinatorics

Shumë e lehtë · Depth-first Search · Graphs

E lehtë · Two pointers

Mesatare · Dynamic programming · Strings

Mesatare · Two pointers

Shumë e lehtë · Binary Search

E lehtë · Implementation · Number theory

E lehtë · Implementation

Shumë e lehtë · Dynamic programming

E lehtë · Implementation · Dynamic programming

E lehtë · Implementation

Shumë e lehtë · Greedy algorithms · Priority Queue · Sorting

E lehtë · Combinatorics

Mesatare · Greedy algorithms · Combinatorics · Math

E lehtë · Number theory · Sorting

Mesatare · Dynamic programming

Shumë e lehtë · Combinatorics · Probabilities

Shumë e lehtë · Trees · Depth-first Search

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

Mesatare · Breadth-first Search · Shortest paths · Dynamic programming

Shumë e vështirë · Segment Tree · Bitwise Operations · Data Structures · Prefix Sums

Shumë e lehtë · Geometry · Sorting · Hashing · Binary Search · Data Structures