1. Design network data collector 2. 9 balls weight puzzle 3. Design HashMap,How will you handle expansion 4. Max substring without repeating characters
Sigiloso
Max substring without repeating characters: Create an empty set. Iterate over the characters in the string. If the current character is not in the set, add it. If the current character is in the set, empty the set as it represents a substring with repeating characters, and add the character. Return the length of the set as the maximum substring without repeating characters.