Skip to main content

Set interface in Java with examples | HashSet, LinkedHashSet, TreeSet Class | SortedSet Interface

Guide to Set Interface in Java with SortedSet, HashSet, LinkedHashSet and TreeSet

A Guide to Set Interface in Java HashSet | LinkedHashSet | TreeSet | SortedSet

Set Interface (java.util.set)

Set is part of Collection Framework. Set directly extends Collection interface and uses its capability.

Set is unordered data structure and contains only unique values means does not contains duplicate values.

Following are child classes and interfaces of Set interface :

  1. HashSet Class
  2. LinkedHashSet Class
  3. SortedSet Interface
  4. TreeSet Class

HashSet Class :

HashSet contains unordered elements and can not contains duplicate elements.

How to create new HashSet?

Set set = new HashSet()

Or

HashSet hashSet = new HashSet()

Lets see example of HashSet :

Example 1 : HashSet class demo

import java.util.HashSet;
import java.util.Set;

public class HashSetDemo {

    public static void main(String[] args) {

        Set<String> set = new HashSet<>() {{
            add("Java");
            add("Java");
            add("Python");
            add("JavaScript");
            add("C++");
            add("Php");
            add("Clanguage");
            add("DotNet");
        }};
       
        System.out.println(set);
    }
}

Output :

[Clanguage, Java, C++, JavaScript, Php, Python, DotNet]

As you can see in output, Set does not follow insertion order and contains only unique values.  

LinkedHashSet Class :

LikedHashSet maintains insertion order and contains only unique values.

Example 2 :LinkedHashSet class demo

import java.util.LinkedHashSet;
import java.util.Set;

public class HashSetDemo {

    public static void main(String[] args) {

        Set<String> set = new LinkedHashSet<String>() {{
            add("Java");
            add("Java");
            add("Python");
            add("JavaScript");
            add("C++");
            add("Php");
            add("Clanguage");
            add("DotNet");
        }};
       
        System.out.println(set);
    }
}

Output :

[Java, Python, JavaScript, C++, Php, Clanguage, DotNet]

As you can see in output LinkedHashSet maintains insertion order.

SortedSet Interface :

SortedSet interface is child of Set interface. It maintains elements in sorting (ascending) order.

As SortedSet is interface, we can not create Object of that. We need class that implements SortedSet. TreeSet class is implementation of SortedSet interface.

TreeSet Class :

TreeSet is part of Set data structure. It implements NavigableSet that extends SortedSet. Elements of the TreeSet class are stored in ascending order.

TreeSet does not allow null value.

We can also get first and last element using first() and last() method of SortedSet.

Example 3 : TreeSet class demo

import java.util.SortedSet;
import java.util.TreeSet;

public class HashSetDemo {

    public static void main(String[] args) {

        SortedSet<String> set = new TreeSet<String>() {{
            add("Java");
            add("Java");
            add("Python");
            add("JavaScript");
            add("C++");
            add("Php");
            add("Clanguage");
            add("DotNet");
        }};
       
        System.out.println(set);
        System.out.println("First element in Treeset : " +set.first()); 
        System.out.println("Last element in Treeset : " +set.last());
    }
}

Output :

[C++, Clanguage, DotNet, Java, JavaScript, Php, Python]
C++
Python

 

Other articles :


Comments

Popular posts from this blog

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...