Longest Substring Without Repeating Characters

Algorithm Overview:

Use two pointers (sliding window) to find the longest substring without repeating characters. Expand the window by moving the right pointer, and shrink it from the left when duplicates are found.