Awesome SPOJ Problems

A list of some SPOJ problems which are interesting, brainstorming and helps understanding and implementing the concepts of Algos and Data Structures.

Dynamic Programming

MARTIAN (for beginners)
EDIST (classical edit distance problem)
SUMITR (good for beginners)
CLSLDR
SOCOLA (medium-hard DP)
LPIS
R6PL
MAXI

Binary Search

RETRO (one of my favourites :D)
EKO
AGGRCOW
METEORS (parallel binary search)
MAXSET

Number Theory

ADAGCD
GCDS
DISTX (good number theory problem)
GCDEASY

Segment tree & derivatives

ADATAXES
ADARAIN
SALMAN
TEMPLEQ
SEQPAR (binary search in segment tree)
TRIPINV
CDC12_H

Graph Theory

IAPCR2F (good DSU problem)
RTREE (finding diameter in tree using dynamic programming)

Sorting

SLEXSORT

Mo's Algorithm

COT2 (Mo's algorithm on trees)

Treap

GSS6 (Implicit Treap)

Greedy

TROOPS

Heavy-Light Decomposition

Centroid Decomposition

Miscellaneous

IITKWPCH