Problemat

E vështirë · Trees · Binary Search · Dynamic programming · Constructive Algorithms · Bitwise Operations

E vështirë · Breadth-first Search · Constructive Algorithms

Shumë e vështirë · Trees · Hashing · Depth-first Search · Constructive Algorithms

E lehtë · Prefix Sums

E lehtë · Number theory · Math

E lehtë · Math · Number theory

E vështirë · Sorting · Binary Search · Greedy algorithms

E vështirë · Combinatorics · Bitwise Operations · Prefix Sums · Number theory

E vështirë · Greedy algorithms · Sorting · Binary Search · Strings

Mesatare · Segment Tree · Implementation

E lehtë · Prefix Sums · Strings · Queries

Mesatare · Dynamic programming

Mesatare · Stacks · Binary Search · Two pointers

E lehtë · Two pointers

Shumë e lehtë · Dynamic programming

E lehtë · Combinatorics

Mesatare · Trees · Dynamic programming · Depth-first Search · Greedy algorithms

Mesatare · Combinatorics

Shumë e lehtë · Combinatorics · Probabilities

Mesatare · Implementation

E vështirë · Bitwise Operations · Number theory · Combinatorics · Dynamic programming

Shumë e vështirë · Bitwise Operations · Shortest paths · Graphs · Dynamic programming

Shumë e vështirë · Games · Greedy algorithms · Math

Mesatare · Trees · Depth-first Search · Disjoint set union · Graphs · Sorting

Shumë e vështirë · Bitwise Operations · Data Structures · Greedy algorithms