Difficulty Level: MEDIUM
Problem Statement:
Given a string `s`, find the length of the longest substring without repeating characters.
Input:
s = "abcabcbb"
Output:
3 //The longest substring without repeating characters is "abc", which has a length of 3.