Problemat

E lehtë · Trees · Depth-first Search · Prefix Sums

Shumë e vështirë · Segment Tree · Greedy algorithms · Dynamic programming

E lehtë · Segment Tree · Range queries

Shumë e lehtë · Brute force

Mesatare · Combinatorics · Number theory · Brute force

Shumë e lehtë · Greedy algorithms · Sorting · Implementation

E vështirë · Meet-in-the-middle · Hashing · Strings

Mesatare · Brute force · Number theory · Combinatorics

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

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

E vështirë · Dynamic programming · Prefix Sums

E vështirë · Greedy algorithms · Sorting · Data Structures

Mesatare · Strings · Stacks

Shumë e lehtë · Prefix Sums · Greedy algorithms

Mesatare · Dynamic programming

E lehtë · Strings · Prefix Function · Data Structures · Stacks

Mesatare · Dynamic programming

E lehtë · Greedy algorithms · Priority Queue · Graphs

E lehtë · Dynamic programming · Fenwick Tree · Data Structures · Prefix Sums

E vështirë · Strings · Hashing · Data Structures

Shumë e vështirë · Divide and Conquer · Convex Hull · Data Structures

Shumë e lehtë · Brute force

E vështirë · Greedy algorithms · Graphs · Shortest paths

Shumë e lehtë · Binary Search · Math · Two pointers

Mesatare · Bitmasks · Brute force · Shortest paths