from typing import Sequence


def directed_adj_list(edges: Sequence[Sequence]) -> dict:
    """Creates a directed graph represented as an adjacency list.

    Args:
        edges (Sequence[Sequence]): A list of edges pairs, ex: [('A', 'B'), ('A', 'C')].

    Returns:
        dict: An adjacency list where key = node and values = neighbors of that node.
    """
    d = {}
    for start, end in edges:
        if start not in d:
            d[start] = []
        d[start].append(end)

        if end not in d:
            d[end] = []

    return d