def compute_z_array(s: str) -> list[int]:
    """
    Compute the Z array for a string.
 
    The Z array Z[i] gives the length of the longest substring starting at position i
    that is also a prefix of the string.
 
    Args:
        s: The input string
 
    Returns:
        The Z array for the string
    """
    # Twoja implementacja
    pass
 
def z_pattern_match(text: str, pattern: str) -> list[int]:
    """
    Use the Z algorithm to find all occurrences of a pattern in a text.
 
    Args:
        text: The text to search in
        pattern: The pattern to search for
 
    Returns:
        A list of starting positions (0-indexed) where the pattern was found in the text
    """
    # Twoja implementacja
    pass

s = "aabcaabxaaz"
z_array: [0, 1, 0, 0, 3, 1, 0, 0, 2, 1, 0]

text = "ABABABABABA"
pattern = "ABA"
Wynik: [0, 2, 4, 6, 8]