Print All Distinct Elements of a given integer array | GeeksforGeeks

This video is contributed by Shubham Kumar

Please Like, Comment and Share the Video among your friends.

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)

[monikakl]

I think sorting is not a good idea unless it is asked to print distinct elements in sorted manner.
By sorting, relative order of elements will be lost and hence may fail to pass test cases.

[tejkumarkempaiah]

Thanks for the vidoe, Can you share the same logic for Java?

[Chachavimdhayak]

We can also do this efficiently in c++ by taking set, traversing array and checking if that element exist in set or not. If not, then add the element and print the elements.

[pawanshaw]

Sorry to say but I am unable to understand ur first code ...I am learning now..start phase

[remstondsa]

We can even use hashMap or sets and get in O(n)

[muddabirnaikodi]

dude expaline how program work...???en we will get the progrm in google

[InDiAnAjOnEs]

Mic se doori banaye...mic ke andar jaane ki koshish na karein..

[rahulnag]

can you write same code in javascript??

[palaksoni]

Using HashSet could u pls explain why u have use if condition u can directly add it in hashset and if duplicate values comes it won't add in Hashset as it doesn't allow duplicate.

[rajeshdansena]

Is it possible to do it in O(n) with out using any auxiliary variable(here the set depends upon n and so I don't want any extra such variable)?

Thanks!

[shivamtiwari]

can u plz explain why u wrote count << arr[i] << " ";