Data structure

• RMQ
• LCA
• Fenwick
• Segment tree 2D & Lazy Update
• Sqrt Decomposition.

Geometry

• Basic Consepts (Special Points)
• Convex Hull
• Rotating Callipers
• Polygon Intersection
• isSimple
• Solution Ideas.

String

• KMP
• Suffix Array
• parse
• java regexp

Network Flow Algorithms

• Edmond Karp.
• Variants.
• MCMF

Todo:

Hight Priority

• Correct Primes.cpp & Factoring Problem.
• Inversion and fenwick.
• Expression Evaluation
• Fibonacci Matrix (Not Necessary)
• Min Cost Max Flow
• Coordinate Compression (UVa 1092)
• Strongly Connected Components (Tarjan or Kosaraju's Algorithm)
• Print Path for new LIS
• SPFA Algorithm (Shortest Path with Negative Cycle)
• Sparse Table for Static RMQ
• Interval Tree
• Basic Geometry
• Max Subrecangle Sum

Low Priority

• Infix and postfix to Tree
• Magic Square Construction
• Pollard's rho algorithm (UVa 11476)

Links

• Stanford Introduction to Competitive programming Course