Sliding window approach to find longest substring without repeating characters has time complexity:

Question

Accepted Answer

(C) O(n). Explanation: Both expand and contract the window at most n times total → O(n) with hash set for O(1) lookups.