Java Collection, HashSet Exercises: Remove all of the elements from a hash set

Java Collection, HashSet Exercises: Exercise-12 with Solution

Write a Java program to remove all of the elements from a hash set.

Sample Solution:

Java Code:

import java.util.*;
  public class Exercise12 {
  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
           System.out.println("Original hash set contains: "+ h_set);
      //  clear() method removes all the elements from a hash set
      // and the set becomes empty.
     // Display original hash set content again
          System.out.println("HashSet content: "+h_set);

Sample Output:

Original hash set contains: [Red, White, Black, Green]                 
HashSet content: []

Pictorial Presentation:

Java Collection, ArrayList Exercises: Remove all of the elements from a hash set


Flowchart: Remove all of the elements from a hash set.

Java Code Editor:

Contribute your code and comments through Disqus.

What is the difficulty level of this exercise?

Java: Tips of the Day

Choice between Float and Double:

Data type Bytes used Significant figures (decimal)
Float 4 7
Double 8 15

Double is often preferred over float in software where precision is important because of the following reasons:
Most processors take nearly the same amount of processing time to perform operations on Float and Double. Double offers far more precision in the same amount of computation time.

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