Print sorted unique elements of a given array

Objective: Given an array of integers with duplicates, write a program to print unique elements in the array in sorted order.

Example:

Given Input: [6, 1, 8, 5, 2, 10, 17, 25, 6, 5, 1, 8, 8]
Sorted Distinct Elements: 1 2 5 6 8 10 17 25 

Given Input: [2, 2, 2, 2]
Sorted Distinct Elements: 2

Approach: Use Tree Set

Set maintains unique elements and tree set maintains unique elements in sorted order. So insert all the elements of input array to the tree set and then print the set.

Complete Code:

Output:

Given Input: [6, 1, 8, 5, 2, 10, 17, 25, 6, 5, 1, 8, 8]
Sorted Distinct Elements: 1 2 5 6 8 10 17 25

Also Read:

- Majority Element – Part 1 Beginner
- Override the compare function for Arrays.sort method - Java Beginner
- Find first three largest elements in a given array Beginner
- Find Three Consecutive Odd Numbers in an array Beginner
- Number of Islands Medium
- ZigZag OR Diagonal traversal in 2d array/Matrix using queue Medium
- Print All Combinations of subset of size K from Given Array Hard
- Grouping of Anagrams Medium