How do you find the distinct elements in a given array?

Question

Accepted Answer

Find distinct elements in a given array of size n<=20.

Iterate through the array and add each element to a set.
Return the size of the set as the number of distinct elements.
Example: [1, 2, 3, 2, 1] -> {1, 2, 3} -> 3 distinct elements.

Accepted Answer

#include
 void distict_elements(int a[], int n);
 int main()
 {
 int size_array, i, arr[20];
 // Get the array size
 scanf(â€œ%dâ€, &size_array)
 // Get the array elements
 for(i=0; i<size_array; i++)
 {
 scanf(â€œ%dâ€, &arr[i]);
 }
 // Function call to print the distinct elements in an array
 distict_elements(arr, size_array);
 return 0;
 }
 void distict_elements(int a[], int n)
 {
 int i, j;
 // Pick all elements one by one
 for (i=0; i<n; i++)
 {
 // Check if the picked element is already printed
 for (j=0; j<i; j++)
 {
 if (a[i] == a[j])
 break;
 }
 // If not printed earlier, then print it
 if (i == j)
 printf(â€œ%d â€œ, a[i]);
 }
 }

How do you find the distinct elements in a given array?

TCS Assistant System Engineer interview questions & answers

Popular interview questions of Assistant System Engineer

Top HR questions asked in TCS Assistant System Engineer