Patterns

Uses a moving window to work with contiguous parts of an array or string.

Uses two indices to scan or compare elements efficiently.

Stores running sums so subarray sums can be found quickly.

Uses a hash map or set to store and look up values quickly.

Searches by repeatedly cutting the search space in half.

Builds the solution step by step by always choosing the best option available.

Explores possible choices and goes back when a path does not work.

Solves problems by reusing results from smaller subproblems.

Traverses tree nodes either depth first or level by level.

Explores connections between nodes in a network.

Keeps track of the smallest or largest element efficiently.