w3resource

Java Collection, HashSet Exercises: Compare two hash set

Java Collection, HashSet Exercises: Exercise-10 with Solution

Write a Java program to compare two hash sets.

Sample Solution:

Java Code:

import java.util.*;
  public class Exercise10 {
  public static void main(String[] args) {
     // Create a empty hash set
        HashSet<String> h_set = new HashSet<String>();
     // use add() method to add values in the hash set
          h_set.add("Red");
          h_set.add("Green");
          h_set.add("Black");
          h_set.add("White");

          HashSet<String>h_set2 = new HashSet<String>();
          h_set2.add("Red");
          h_set2.add("Pink");
          h_set2.add("Black");
          h_set2.add("Orange");
          //comparison output in hash set
          HashSet<String>result_set = new HashSet<String>();
         for (String element : h_set){
             System.out.println(h_set2.contains(element) ? "Yes" : "No");
          }      
     }
}

Sample Output:

Yes                                                                    
No                                                                     
Yes                                                                    
No

Pictorial Presentation:

Java Collection, ArrayList Exercises: Compare two hash set

Flowchart:

Flowchart: Compare two hash set.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Convert a hash set to a List/ArrayList.
Next: Compare two sets and retain elements which are same on both sets.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Share this Tutorial / Exercise on : Facebook and Twitter

Java: Tips of the Day

getEnumMap

Converts to enum to Map where key is the name and value is Enum itself. 

public static <E extends Enum<E>> Map<String, E> getEnumMap(final Class<E> enumClass) {
    return Arrays.stream(enumClass.getEnumConstants())
            .collect(Collectors.toMap(Enum::name, Function.identity()));
}

Ref: https://bit.ly/3xXcFZt