Function remove_duplicates

algorithms/array/remove_duplicates.py:20–48

Remove duplicate elements from an array, preserving order. Uses a set for O(1) lookups on hashable items and falls back to linear search for unhashable items. Args: array: Input list potentially containing duplicates. Returns: New list with duplicates removed, orig

(array: list[Any])

def remove_duplicates(array: list[Any]) -> list[Any]:
    """Remove duplicate elements from an array, preserving order.

    Uses a set for O(1) lookups on hashable items and falls back to
    linear search for unhashable items.

    Args:
        array: Input list potentially containing duplicates.

    Returns:
        New list with duplicates removed, original order preserved.

    Examples:
        >>> remove_duplicates([1, 1, 2, 2, 3])
        [1, 2, 3]
    """
    seen = set()
    unique_array = []

    for item in array:
        if isinstance(item, Hashable):
            if item not in seen:
                seen.add(item)
                unique_array.append(item)
        else:
            if item not in unique_array:
                unique_array.append(item)

    return unique_array