Explain the Sliding Window technique.

Explain the Sliding Window technique.

Approach: Describe tracking a contiguous subset of elements with two pointers.

A method for solving array or string problems by maintaining a 'window' of elements and moving its start and end pointers to achieve linear time complexity.

Follow-up: Give an example use case (e.g., longest substring without repeating characters).

Key concepts: contiguous, pointers, O(n).