Write a function
that, given an array A consisting of N integers, returns the number of distinct values in array A.
For example, given array A consisting of six elements such that:A = 2 A = 1 A = 1 A = 2 A = 3 A = 1
the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000].
The solution obtained perfect score.
sequence of one element
sequence of three distinct elements
sequence of 10 equal elements
sequence of negative elements, length=5
sequence with big values, length=5
chaotic sequence of value sfrom [0..1K], length=100
chaotic sequence of value sfrom [0..1K], length=200
chaotic sequence of values from [0..10], length=200