Problem 3 · Medium

Longest Substring Without Repeating Characters

Use a sliding window and a hash map to track characters and dynamically adjust the window size to find the longest substring without duplicates.

Open the interactive visualisation