Probleme

Foarte ușor · Brute force

Foarte ușor · Math

Foarte dificil · Dynamic programming · Prefix Sums

Foarte ușor · Implementation

Foarte ușor · Brute force

Ușor · Math

Ușor · Sorting

Foarte ușor · Implementation

Mediu · Prefix Sums · Binary Search

Dificil · Data Structures · Fenwick Tree · Segment Tree · Greedy algorithms

Mediu · Number theory · Strings

Dificil · Segment Tree · Range queries · Prefix Sums

Foarte dificil · Dynamic programming · Trees · Depth-first Search · Greedy algorithms · Data Structures

Foarte ușor · Implementation

Mediu · Implementation

Ușor · Brute force · Bitwise Operations

Mediu · Math · Number theory

Foarte ușor · Brute force

Foarte ușor · Sorting

Ușor · Graphs · Binary Search

Ușor · Strings · Prefix Function

Dificil · Greedy algorithms · Sorting · Data Structures · Constructive Algorithms

Foarte dificil · Trees · Combinatorics · Math · Dynamic programming

Foarte dificil · String suffix structures · Hashing · Data Structures · Trees · Strings

Dificil · Constructive Algorithms · Bitwise Operations