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

Post a Comment

Popular posts from this blog

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 ...
1 comment
Read more

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And ...
Post a Comment
Read more