💡 Interview Patterns

Two pointers traverse data in different directions or speeds

Maintain a window that slides across the data structure

Divide search space in half repeatedly

Explore all possibilities, backtracking when needed

Level-by-level traversal using a queue

Optimize by storing subproblem solutions

Make locally optimal choices at each step

Use heap to efficiently access min/max elements

Efficient string prefix search and storage