Sliding Window

1 problem using this pattern

Maintain a window of elements and slide it to find optimal subarrays efficiently.

Often used with: Hash Map

Complexity Range


                  O(n)

(1 problem)


                  O(k)

(1 problem)

Find the length of the longest substring without repeating characters.