Leetcode 3. Longest Substring Without Repeating Characters

Find the length of the longest contiguous substring that contains no repeated characters. This is a classic sliding-window / two-pointer problem where you track seen characters to expand and contract the window efficiently (linear-time expected).