Longest Substring Without Repeating Characters

Medium

Longest Substring Without Repeating Characters

MediumCategory: Sliding WindowAcceptance: 74%

Problem Statement

Write an optimal implementation to solve the **longest substring without repeating characters** challenge for Data Structures & Algorithms. Ensure your solution handles edge cases, executes with efficient time complexity, and passes all automated test cases.

Examples

Example 1:

Input: input = [1, 2, 3]

Output: [3, 2, 1]

Explanation: Example transformation for longest substring without repeating characters.

Constraints

1 <= input.length <= 10^5
Time complexity must be O(N) or better.
Space complexity must be O(1) auxiliary space where applicable.

Solution Editor

Input:input = [1, 2, 3]

Expected Output:[3, 2, 1]