Common Algorithm Patterns

Sliding Window (Two Pointers)

# Pattern: Longest Substring Without Repeating Characters
def length_of_longest_substring(s: str) -> int:
    """Find length of longest substring without repeating characters.

    Sliding window technique with hash map to track character positions.
    Time: O(n), Space: O(min(n, alphabet_size))

    Example: "abcabcbb" -> 3 (substring "abc")
    """
    if not s:
        return 0