Skip to content

Advanced -> Algorithm Engineering

Performance work beyond asymptotics: benchmarks, cache behavior, memory layout, and reproducible measurements.

  • Topic slug: advanced/algorithm-engineering
  • Tutorial page: Open tutorial
  • Ladder page: Open ladder
  • Repo problems currently tagged here: 3
  • Repo companion pages: 5
  • Curated external problems: 8

Microtopics

  • benchmarking
  • profiling
  • cache-locality
  • SIMD
  • memory-hierarchy
  • external-memory
  • parallelism
  • reproducibility

Learning Sources

Source Type
MIT 6.506 Algorithm Engineering Course
MIT OCW 6.5060 Course
TU/e Algorithms Engineering Course

Practice Sources

Source Type
PBBS benchmark suite Practice
Sort Benchmark Practice
AtCoder Introduction to Heuristics Practice

Repo Companion Material

Material Type
Contest checklist checklist
Stress testing workflow verification guide
Contest playbooks process guide
Minimum Euclidean Distance note anchor note
Templates overview template guide

Curated External Problems

Core

Problem Source Difficulty Context Style Prerequisites Tags Why it fits
Robot Path CSES Medium - Implementation Hash Set; Coordinate Simulation Hashing; Simulation; Sets A small but instructive exercise in robust simulation and state tracking.
Dynamic Values And Maximum Sum Codeforces Very Hard - - - Tree Process; State Transitions Performance-sensitive tree optimization with many moving parts, ideal for engineering-heavy practice.
Juan's Colorful Tree Codeforces Very Hard - - - Tree Queries; Set Intersections; Hybrid Techniques Shows how serious contest solutions often combine several techniques to meet practical limits.
Minimum Difference Codeforces Very Hard - - - Data Structures; Query Optimization; Implementation Detail A good benchmark for fast query processing where constants and representation choices matter.
Query Jungle Codeforces Very Hard - - - Tree Queries; Toggle Updates; Global State Maintenance Strong example of designing around query/update bottlenecks rather than just the high-level idea.

Challenge

Problem Source Difficulty Context Style Prerequisites Tags Why it fits
Area of Rectangles CSES Hard - Engineering; Event Processing Compression; Segment Tree Or Fenwick Coordinate Compression; Sweep Line; Interval Coverage Great for practicing fast, memory-conscious sweep-line implementation.
Lines and Queries I CSES Hard - Online; Optimized Query Processing Line Evaluation; Convex Hull Trick Convex Hull Trick; Data Structures Rewards clean data-structure engineering and careful constant-factor control.
Minimum Euclidean Distance CSES Hard - Performance Tuning; Geometric Data Structures Sorting; Balanced Search Implementation; Sweep Line; Closest Pair A classic example where asymptotics are simple but implementation details matter.

Repo Problems

Code Title Fit Difficulty Pattern Note Solution
FFLOW Fast Maximum Flow secondary medium maximum flow; undirected capacities; capacity scaling Note Code
MINIMUMEUCLIDEANDISTANCE Minimum Euclidean Distance primary hard closest pair sweep line; active strip by x distance; ordered set by y Note Code
PRAVO Tam giác vuông secondary medium count right triangles; normalized directions; perpendicular pairing Note Code

Regeneration

python3 scripts/generate_problem_catalog.py