Probleme

Foarte ușor · Math

Foarte ușor · Implementation

Ușor · Hashing

Foarte ușor · Sorting · Hashing

Ușor · Sorting · Data Structures

Foarte ușor · Implementation

Foarte ușor · Implementation

Foarte dificil · Bitmasks · Dynamic programming · Graph matchings · Combinatorics

Ușor · Depth-first Search

Foarte dificil · Dynamic programming · Strings · Greedy algorithms · Prefix Function

Foarte dificil · Data Structures · Disjoint set union · Graphs · Divide and Conquer · Segment Tree

Ușor · Breadth-first Search

Dificil · Geometry · Trees · Constructive Algorithms · Depth-first Search · Sorting

Ușor · Prefix Sums

Dificil · Dynamic programming · Prefix Sums

Mediu · String suffix structures · Strings

Foarte dificil · Divide and Conquer · Sparse Table · Binary Search · Range queries · Number theory

Foarte ușor · Graphs

Dificil · Number theory · Math · Prefix Sums

Mediu · Greedy algorithms · Bitwise Operations

Foarte dificil · Strings · Prefix Function · Matrix · Dynamic programming

Foarte ușor · Strings · Brute force

Ușor · Implementation

Dificil · Graphs · Greedy algorithms · Sorting