What is the window invariant in Longest Substring Without Repeating Characters?

Question

What is the window invariant in Longest Substring Without Repeating Characters?

Option A

The window is sorted

Option B — Correct answer

The window has no duplicate characters

Option C

The window has only vowels

Option D

The window always starts at index 0

Explanation

The current window must contain no duplicate characters.

Longest Substring Without Repeating Characters - Sliding window Pattern Practice Quiz