All language subtitles for 9. A Program to count a total number of “non-unique” values in an array - Question

All right, so in this exercise, what you are required to do is basically this exercise kind of depends

on the knowledge that you've gained in the previous one.

Any sense that you need to write a program that should count to total values that are not unique in

a specific area?

OK.

In a specific array.

So.

That's not so trivial.

OK, because the answer is not so obvious.

OK, so we said previously that in this array, in this example, we had six values which were unique,

right?

We had six unique values.

But on the other hand, that means that if the array was of size 10, then we can say that 10 minus

six equals two for four.

None.

Unique values, right?

But that's not exactly what we are looking for.

We are looking for the distinct values that are not unique.

So in this case, we have just the value of five, which is the first value, OK, we took it into a

council.

This will be one value that is not unique.

So five is a non unique value.

None unique.

Value and also we know that what else seven is unique, three is none unique, so we also know that

three is none unique value three is not unique value.

OK, so a total of two non unique values are inside of this array.

OK, so although there are four elements that are not, none unique, but we are looking for a total

value.

So in this case, five and three, these are the only two values that are non unique inside of this

array.

So once again, a total of four elements are non unique, but a total of two values are not unique.

So you need to write program and take these into account and know how to approach it.

OK.

So I wish you good luck.

Give it a shot.

Try it on your own, and I will see you, as always, is almost always in the solutions.

VIDEO.

So good luck, guys.

I'll see you then.