Longest Substring Without Repeating Characters

Problem Find the length of the longest substring without repeating characters. A substring is a continuous part of a string; characters cannot be skipped. View the problem on LeetCode. Examples Inp