Patterns

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

Uses two indices to scan or compare elements in an array or string efficiently.

Pre-computes cumulative sums to find the sum of any subarray in constant time.

Uses a hash map or set to store and retrieve values in average O(1) time.

Searches by repeatedly cutting the search space in half.

Builds the solution step by step by always choosing the best option available at each moment.

Explores all possible choices recursively and 'backtracks' when a choice leads to a dead end.

Solves complex problems by breaking them down into smaller, overlapping subproblems and storing their results.

Traverses tree structures either by going deep first (DFS) or level by level (BFS).

Represents relationships between nodes and explores them using traversal techniques like DFS or BFS.

Maintains elements in a specific order, so the smallest or largest value can be accessed quickly.