Algorithm Patterns

Using two reference points to process data efficiently

Efficiently process continuous subarrays or substrings

Efficiently search in sorted collections

Pre-compute running totals for fast range calculations

Level by level traversal of trees and graphs

Explore as far as possible down each branch before backtracking

Linear ordering of vertices based on dependencies

Breaking complex problems into simpler subproblems

Build solutions incrementally and abandon when they fail

Make locally optimal choices at each stage