Short Problem Definition:

Compute number of distinct absolute values of sorted array elements.

AbsDistinct

Complexity:

expected worst-case time complexity is O(N)

expected worst-case space complexity is O(N)

Execution:

Additional storage is allowed. Therefore a simple python solution will suffice.

Solution:

def solution(A):
    return len(set([abs(x) for x in A]))